Lexicographic product of graphs
= Lexicographic product of graphs
{wiki=Lexicographic_product_of_graphs}
The lexicographic product (or Cartesian product) of two graphs \\( G = (V_G, E_G) \\) and \\( H = (V_H, E_H) \\) is a graph denoted by \\( G \\cdot H \\) (or sometimes \\( G\[H\] \\) or \\( G \\square H \\)).