TOPICS
Search

Switchable Graph

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph.

Conversely, a graph that cannot be reduced to another graph with the same degree sequence by edge-switching is said to be an unswitchable graph.

See also

Degree Sequence, Unswitchable Graph

Explore with Wolfram|Alpha

References

Berge, C. Graphs and Hypergraphs. New York: Elsevier, 1973.Eggleton, R. B. "Graphic Sequences and Graphic Polynomials: A Report." Colloq. Math. Soc. J. Bolyai 10, 385-392, 1975.Mukhopadhyay, A.; John, D.; and Vasudevan, S. "Recognizing and Generating Unswitchable Graphs." 12 Apr 2023. https://arxiv.org/abs/2304.12381.

Cite this as:

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

Subject classifications