Schläfli graph
16-regular graph with 27 vertices and 216 edges
Facts
8 properties- Instance of
- undirected graph, claw-free graph, strongly regular graph, cyclic graph, Eulerian graph, Hamiltonian graph, polytopal graph, overfull graph[2][3][4][5][6][7][8]
- Graph diameter
- 2.0[15]
- Graph girth
- 3.0[16]
- Graph radius
- 2.0[14]
- Maintained by WikiProject
- WikiProject Mathematics[13]
- Named after
- Ludwig Schläfli[9]
- Studied by
- graph theory[10]
🏷️ Also known as
en Schläfli graph
fr graphe de Schläfli
hu Schläfli-gráf
ru граф Шлефли
uk граф Шлефлі
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Schläfli graph.svg ↗
- Described at URL
- jaanos.github.io
- Freebase ID
- /m/0cnz0v9
- MathWorld ID
- SchlaefliGraph
- Microsoft Academic ID (discontinued)
- 2781078742
- The House of Graphs ID
- 1300
- Wolfram Language entity code
- Entity["Graph", "SchlaefliGraph"]
🔗 Connections
Instance of 5
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Schläfli graph is an undirected graph[1].