Wagner Graph


The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs having no K_5 minor can be constructed using clique-sum operations to combine planar graphs and this graph.

The Wagner graph has the most spanning trees among the six 8-vertex cubic graphs, namely 392.

See also

Möbius Ladder

Explore with Wolfram|Alpha


Bondy, J. A. and Murty, U. S. R. Graph Theory. Berlin: Springer-Verlag, pp. 275-276, 2008.Wagner, K. "Über eine Eigenschaft der ebenen Komplexe." Math. Ann. 114, 570-590, 1937.

Cite this as:

Weisstein, Eric W. "Wagner Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications