graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H...

In graph theory, the Cartesian product G □ H of graphs G and H is a graph such that: the vertex set of G □ H is the Cartesian product V(G) × V(H); and...

In graph theory, the tensor product G × H of graphs G and H is a graph such that the vertex set of G × H is the Cartesian product V(G) × V(H); and vertices...

In graph theory, the strong product is a way of combining two graphs to make a larger graph. Two vertices are adjacent in the strong product when they...

In graph theory, the lexicographic product or (graph) composition G ∙ H of graphs G and H is a graph such that the vertex set of G ∙ H is the cartesian...

In mathematical graph theory, the rooted product of a graph G and a rooted graph H is defined as follows: take |V(G)| copies of H, and for every vertex...

graph from an initial one by a complex change, such as: transpose graph; complement graph; line graph; graph minor; graph rewriting; power of graph;...

In graph theory, the hypercube graph Qn is the graph formed from the vertices and edges of an n-dimensional hypercube. For instance, the cube graph Q3...

a new type of graph product, called the zig-zag product. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its...

Cartesian product of graphs is not a product in the sense of category theory. Instead, the categorical product is known as the tensor product of graphs. Axiom...

Cartesian product of a number of complete graphs. A common type of lattice graph (known under different names, such as grid graph or square grid graph) is the...

of graphs, cartesian product of graphs, tensor product of graphs, strong product of graphs, lexicographic product of graphs, series–parallel graphs. In...

distributions through the sum–product algorithm. One of the important success stories of factor graphs and the sum–product algorithm is the decoding of...

In graph theory, the corona product of graphs G and H, denoted G ∘ H {\displaystyle G\circ H} , can be obtained by taking one copy of G, called the center...

In graph theory, the zig-zag product of regular graphs G , H {\displaystyle G,H} , denoted by G ∘ H {\displaystyle G\circ H} , is a binary operation which...

In graph theory, the modular product of graphs G and H is a graph formed by combining G and H that has applications to subgraph isomorphism. It is one...

is one. The Hamming graph H(d,q) is, equivalently, the Cartesian product of d complete graphs Kq. In some cases, Hamming graphs may be considered more...

cycle graph of a group is an undirected graph that illustrates the various cycles of that group, given a set of generators for the group. Cycle graphs are...

In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...

In graph theory, the replacement product of two graphs is a graph product that can be used to reduce the degree of a graph while maintaining its connectivity...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

of random variables Graph product Product (Brand X album), 1979 Product (De Press album), 1982 Product (Sophie album), 2015 Product, a three-CD compilation...

product representation of a simple graph is a method of representing a graph using vector spaces and the dot product from linear algebra. Every graph...

complete graph, as the tensor product Kn × K2, as the complement of the Cartesian direct product of Kn and K2, or as a bipartite Kneser graph Hn,1 representing...

In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and...

In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability...

In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It is named...

In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract...