The graph product denoted G•H and defined by the adjacency relations (g adj g') or (g = g' and h adj h'). The graph lexicographic product is also known as the graph composition. Graph lexicographic products can be computed in the Wolfram Language using GraphProduct[G1, G2, Lexicographic]. The "double graph" of a given graph G is the graph lexicographic product G•K_2.

double graph | graph composition | graph product