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...
7 KB (610 words) - 20:29, 23 March 2025
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...
8 KB (869 words) - 03:16, 15 December 2024
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...
11 KB (1,450 words) - 01:00, 26 March 2025
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...
13 KB (1,316 words) - 03:24, 6 January 2024
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...
3 KB (476 words) - 22:22, 19 July 2023
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...
4 KB (424 words) - 07:40, 21 April 2025
graph from an initial one by a complex change, such as: transpose graph; complement graph; line graph; graph minor; graph rewriting; power of graph;...
5 KB (512 words) - 23:48, 9 March 2025
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...
3 KB (328 words) - 16:59, 20 April 2023
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...
6 KB (538 words) - 00:46, 18 March 2025
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...
27 KB (3,945 words) - 17:31, 22 April 2025
of graphs, cartesian product of graphs, tensor product of graphs, strong product of graphs, lexicographic product of graphs, series–parallel graphs. In...
28 KB (3,671 words) - 04:30, 15 May 2025
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...
4 KB (547 words) - 23:31, 25 September 2024
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...
7 KB (1,194 words) - 04:14, 6 March 2025
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...
3 KB (282 words) - 04:13, 7 April 2025
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...
7 KB (651 words) - 18:01, 9 May 2025
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...
13 KB (1,555 words) - 00:07, 10 May 2025
of random variables Graph product Product (Brand X album), 1979 Product (De Press album), 1982 Product (Sophie album), 2015 Product, a three-CD compilation...
2 KB (246 words) - 17:34, 11 July 2024
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...
41 KB (5,397 words) - 06:00, 5 June 2025
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...
3 KB (277 words) - 10:57, 25 October 2024
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...
35 KB (4,541 words) - 18:29, 29 May 2025
Hedetniemi's conjecture (redirect from Hedetniemi's graph coloring conjecture)
1966, concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that χ ( G × H ) = min { χ ( G ) , χ ( H )...
15 KB (1,853 words) - 15:10, 16 January 2025
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...
2 KB (200 words) - 02:27, 6 March 2025
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...
12 KB (1,840 words) - 16:54, 9 December 2024
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...
16 KB (1,821 words) - 21:44, 19 January 2025
distributions through the sum–product algorithm. One of the important success stories of factor graphs and the sum–product algorithm is the decoding of...
7 KB (1,027 words) - 22:20, 25 November 2024
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...
21 KB (2,007 words) - 21:40, 19 May 2024
Vizing's conjecture (category Graph products)
mathematics In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture...
9 KB (1,034 words) - 01:24, 19 March 2025
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability...
15 KB (2,328 words) - 11:46, 21 March 2025
graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign. A signed graph is balanced if the product of...
23 KB (3,249 words) - 00:57, 26 February 2025
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...
59 KB (7,055 words) - 07:30, 25 February 2025