[3] It is named after Peter G. Doyle and Derek F. Holt, who discovered the same graph independently in 1976[4] and 1981[5] respectively.

The Holt graph has diameter 3, radius 3 and girth 5, chromatic number 3, chromatic index 5 and is Hamiltonian with 98,472 distinct Hamiltonian cycles.

[6] This is a smaller group than a symmetric graph with the same number of vertices and edges would have.

The graph drawing on the right highlights this, in that it lacks reflectional symmetry.

The characteristic polynomial of the Holt graph is