Holt graph
graph with 27 vertices and 54 edges, the smallest half-transitive graph
Facts
7 properties- Instance of
- half-transitive graph, Hamiltonian graph, Cayley graph, square-free graph, quartic graph, triangle-free graph, overfull graph[2][3][4][5][6][7]
- Defining formula
- (x^3-6x+2)^6(x+2)^4(x-1)^4(x-4)
- Graph diameter
- 3[13]
- Graph girth
- 5[14]
- Graph radius
- 3[12]
- Studied by
- graph theory[8]
🏷️ Also known as
en Doyle graph
en Holt graph
fr graphe de Doyle
hu Doyle-gráf
hu Holt-gráf
ja ホルトグラフ
pt Grafo de Holt
ru граф Дойла
ru граф Хольта
🔖 Identifiers · 5
- Image (Wikimedia Commons)
- Holt graph.svg ↗
- Freebase ID
- /m/07kbs93
- MathWorld ID
- DoyleGraph
- The House of Graphs ID
- 1051
- Wolfram Language entity code
- Entity["Graph", "DoyleGraph"]
🔗 Connections
Instance of 6
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Holt graph is a half-transitive graph[1].