TOPICS
Search

Graph Lexicographic Product


The graph product denoted G-H and defined by the adjacency relations (gadjg^') or (g=g^' and hadjh^'). The graph lexicographic product is also known as the graph composition (Harary 1994, p. 21).

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.


See also

Double Graph, Graph Composition, Graph Product

This entry contributed by Nicolas Bray

Explore with Wolfram|Alpha

References

Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.Imrich, W.; Klavzar, S.; and Rall, D. F. Graphs and their Cartesian Product. Wellesley, MA: A K Peters, 2008.

Referenced on Wolfram|Alpha

Graph Lexicographic Product

Cite this as:

Bray, Nicolas. "Graph Lexicographic Product." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/GraphLexicographicProduct.html

Subject classifications