Holt graph

graph with 27 vertices and 54 edges, the smallest half-transitive graph
Thing Half Transitive Graph Q3115479

Facts

7 properties
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]
Has part(s) of the class
node, edge[9][10]
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"]

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Instance of 6
Has part(s) of the class 2
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds

Summary

Holt graph is a half-transitive graph[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Holt graph. Retrieved November 18, 2026, from https://4ort.xyz/entity/holt-graph
MLA “Holt graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Nov. 2026, https://4ort.xyz/entity/holt-graph.
BibTeX @misc{4ortxyz_holt-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Holt graph}}, year = {2026}, url = {https://4ort.xyz/entity/holt-graph}, note = {Accessed: 2026-11-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Holt graph — https://4ort.xyz/entity/holt-graph (retrieved 2026-11-18)

Canonical URL: https://4ort.xyz/entity/holt-graph · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 6w ago · Dexxor · 2026-10-07 view diff on Wikidata ↗
    Graph radius → 3
    Studied by → graph theory
    Maintained by WikiProject → WikiProject Mathematics
    Graph girth → 5
    + 3 other properties edited (see Wikidata diff for full list)
    "Changed the item: QuickStatements 3.0 batch #58239: graph being Eulerian is implied by graph being quartic"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.