In graph theory, the Cartesian productG □ 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
two vertices (u,v) and (u' ,v' ) are adjacent in G □ H if and only if either
u = u' and v is adjacent to v' in H, or
v = v' and u is adjacent to u' in G.
The Cartesian product of graphs is sometimes called the box product of graphs [Harary 1969].
The operation is associative, as the graphs (F □ G) □ H and F □ (G □ H) are naturally isomorphic.
The operation is commutative as an operation on isomorphism classes of graphs, and more strongly the graphs G □ H and H □ G are naturally isomorphic, but it is not commutative as an operation on labeled graphs.
The notation G × H has often been used for Cartesian products of graphs, but is now more commonly used for another construction known as the tensor product of graphs. The square symbol is intended to be an intuitive and unambiguous notation for the Cartesian product, since it shows visually the four edges resulting from the Cartesian product of two edges.[1]
^Hahn & Sabidussi (1997).
and 23 Related for: Cartesian product of graphs information
product of two sets Cartesianproductofgraphs, a binary operation on graphsCartesian tree, a binary tree in computer science Cartesian anxiety, a hope...
In graph theory, the tensor product G × H ofgraphs G and H is a graph such that the vertex set of G × H is the Cartesianproduct V(G) × V(H); and vertices...
theory, the Cartesianproductof two sets A and B, denoted A × B, is the set of all ordered pairs (a, b) where a is in A and b is in B. In terms of set-builder...
in graph theory. The strong productof any two graphs can be constructed as the union of two other productsof the same two graphs, the Cartesian product...
graph theory, the lexicographic product or (graph) composition G ∙ H ofgraphs G and H is a graph such that the vertex set of G ∙ H is the cartesian product...
bound of Vizing's conjecture, an unproven inequality between the domination number of the graphs in a different graphproduct, the cartesianproductof graphs...
graph theory, a graphproduct is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H...
as the Cartesianproductof a number of complete graphs. A common type of a lattice graph (known under different names, such as square grid graph) is the...
the box topology The cartesianproductofgraphs This disambiguation page lists articles associated with the title Box product. If an internal link led...
is one. The Hamming graph H(d,q) is, equivalently, the Cartesianproductof d complete graphs Kq. In some cases, Hamming graphs may be considered more...
a wheel graph on n vertices. Unsolved problem in mathematics: Is the pebbling number of a Cartesianproductofgraphs at most the productof the pebbling...
direct productof objects already known, giving a new one. This induces a structure on the Cartesianproductof the underlying sets from that of the contributing...
operation (for unlabelled graphs); graphproducts based on the cartesianproductof the vertex sets: cartesiangraphproduct: it is a commutative and associative...
In graph theory, the modular productofgraphs G and H is a graph formed by combining G and H that has applications to subgraph isomorphism. It is one...
Cartesian coordinate system (UK: /kɑːrˈtiːzjən/, US: /kɑːrˈtiːʒən/) in a plane is a coordinate system that specifies each point uniquely by a pair of...
calculation of the Buneman graph, and use this construction to visualize human genetic relationships. The Cartesianproductof every two median graphs is another...
algorithm on any graph. Vizing's conjecture - relates the domination number of a cartesianproductofgraphs to the domination number of its factors. Set...
numbers, these pairs are Cartesian coordinates of points in a plane and often form a curve. The graphical representation of the graphof a function is also...
obtained as the Cartesianproductof two path graphs, one of which has only one edge: Ln,1 = Pn × P2. By construction, the ladder graph Ln is isomorphic...
construction of Qn is the Cartesianproductof n two-vertex complete graphs K2. More generally the Cartesianproductof copies of a complete graph is called...
Appendix:Glossary ofgraph theory in Wiktionary, the free dictionary. This is a glossary ofgraph theory. Graph theory is the study ofgraphs, systems of nodes or...
Global Information