Wagner graph
cubic graph with 8 vertices and 12 edges
Facts
7 properties- Instance of
- Hamiltonian graph, cubic graph, triangle-free graph, vertex-transitive graph, toroidal graph, Möbius ladder, Andrásfai graph, bivariegated graph, triconnected graph[2][3][4][5][6][7][8][9]
- Graph diameter
- 2[16]
- Graph girth
- 4[17]
- Graph radius
- 2[15]
- Named after
- Klaus Wagner[10]
- Studied by
- graph theory[11]
🏷️ Also known as
en Wagner graph
fr graphe de Wagner
hu Wagner-gráf
ru граф Вагнера
🔖 Identifiers · 6
- Image (Wikimedia Commons)
- Wagner graph ham.svg ↗
- Freebase ID
- /m/07s6tnm
- MathWorld ID
- WagnerGraph
- Microsoft Academic ID (discontinued)
- 111291908
- The House of Graphs ID
- 640
- Wolfram Language entity code
- Entity["Graph", "WagnerGraph"]
🔗 Connections
Instance of 6
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Wagner graph is a Hamiltonian graph[1].