Cartesian product of graphs
= Cartesian product of graphs
{c}
{title2=$G\mathbin\square H$}
For two <graphs> $G,H$, their <Cartesian product of graphs> has <graph vertices> $(g,h)\in V(G)\times V(H)$. Two <graph vertices> are adjacent if either their $G$ coordinates agree and their $H$ coordinates are adjacent, or conversely their $H$ coordinates agree and their $G$ coordinates are adjacent. The <ladder graph> is the product of a <graph path> with $K_2$.