Pappus graph
graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration
Facts
7 properties- Instance of
- undirected graph, bipartite graph, symmetric graph, cubic graph, Hamiltonian graph, distance-transitive graph, distance-regular graph, Levi graph, square-free graph, triconnected graph[2][3][4][5][6][7][8][9][10]
- Graph diameter
- 4[17]
- Graph girth
- 6[18]
- Graph radius
- 4[16]
- Named after
- Pappus of Alexandria[11]
- Studied by
- graph theory[12]
🏷️ Also known as
en Pappus graph
es grafo de Papo
es grafo de Pappus
fr graphe de Pappus
hu Papposz-gráf
it grafo di Pappo
ja パップスグラフ
ru граф Паппа
zh 帕普斯圖
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Граф Паппа.png ↗
- Described at URL
- jaanos.github.io
- Freebase ID
- /m/025x7qk
- MathWorld ID
- PappusGraph
- Microsoft Academic ID (discontinued)
- 86466045
- The House of Graphs ID
- 1248
- Wolfram Language entity code
- Entity["Graph", "PappusGraph"]
🔗 Connections
Instance of 8
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Pappus graph is an undirected graph[1].