Heawood graph
undirected graph with 14 vertices, 21 edges, and girth 6
Facts
8 properties- Instance of
- undirected graph, bipartite graph, cubic graph, cage, distance-transitive graph, toroidal graph, Hamiltonian graph, symmetric graph, 1-planar graph, Levi graph, square-free graph, triconnected graph[2][3][4][5][6][7][8][9][10][11][12]
- Depicts
- Szilassi polyhedron[14]
- Graph diameter
- 3
- Graph girth
- 6
- Graph radius
- 3
- Named after
- Percy John Heawood[13]
- Studied by
- graph theory[15]
🏷️ Also known as
en Heawood graph
ar بيان هِيوُد
cs Heawoodův graf
de Heawood-Graph
es Grafo de Heawood
fa گراف هیوود
fr graphe de Heawood
it Grafo di Heawood
ja ヒーウッドグラフ
ro graful Heawood
ru граф Хивуда
uk граф Хівуда
zh Heawood圖
zh 希伍德圖
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Heawood Graph.svg ↗
- Described at URL
- jaanos.github.io
- Freebase ID
- /m/04z9rz
- MathWorld ID
- HeawoodGraph
- Microsoft Academic ID (discontinued)
- 200222346
- The House of Graphs ID
- 1154
- Wolfram Language entity code
- Entity["Graph", "HeawoodGraph"]
🔗 Connections
Instance of 10
Created notable works 1
Depicts 1
Maintained by WikiProject 1
Named after 1
Studied by 1
← Depicted by 1
Press Enter · cited answer in seconds
0 sources
Summary
Heawood graph is an undirected graph[1].