Cartesian product of graphs

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 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. The operation is associative, as the graphs (F □ G) □ H and F □ (G □ H) are naturally isomorphic.

Source: Wikipedia — Cartesian product of graphs (CC BY-SA 4.0)

Cartesian product of graphs

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 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. The operation is associative, as the graphs (F □ G) □ H and F □ (G □ H) are naturally isomorphic.

This neuron ends here.

Source: Wikipedia "Cartesian product of graphs" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy