Double Graph

The double graph of a given graph G is constructed by making two copies of G (including the initial edge set of each) and adding edges u_1v_2 and v_1u_2 for every edge uv of G.

Note that the double graph differs from the bipartite double graph in that the initial edge set is retained in the double graph, while it is discarded in the bipartite double graph.

See also

Bipartite Double Graph, Cycle Double Cover, Graph Lexicographic Product

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.

Referenced on Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Double Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DoubleGraph.html

Subject classifications