Clebsch graph
one of two different regular graphs with 16 vertices
Facts
7 properties- Instance of
- undirected graph, dyad, strongly regular graph, Hamiltonian graph, triangle-free graph, Cayley graph, vertex-transitive graph, edge-transitive graph, distance-transitive graph, integral graph, quintic graph[2][3][4][5][6][7][8][9][10][11]
- Graph diameter
- 2[18]
- Graph girth
- 4
- Graph radius
- 2[17]
- Named after
- Alfred Clebsch[12]
- Studied by
- graph theory[13]
🏷️ Also known as
en Clebsch graph
de Clebsch-Graph
es Grafo de Clebsch
fr graphe de Clebsch
hu Clebsch-gráf
ja クレブシュグラフ
ru граф Гринвуда — Гизона
ru граф Гринвуда-Гизона
ru граф Клебша
uk граф Грінвуда — Глізона
zh 克萊布殊圖
🔖 Identifiers · 6
- Described at URL
- jaanos.github.io
- Freebase ID
- /m/076x2x8
- MathWorld ID
- ClebschGraph
- Microsoft Academic ID (discontinued)
- 154997066
- The House of Graphs ID
- 975
- Wolfram Language entity code
- Entity["Graph", "ClebschGraph"]
🔗 Connections
Instance of 9
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Clebsch graph is an undirected graph[1].