Holt graph
id:
holt-graph-321-10606507
title:
Holt graph
text:
In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive graph which is not also symmetric. Such graphs are not common. It is named after Peter G. Doyle and Derek F. Holt, who discovered the same graph independently in 1976 and 1981 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Holt_graph
date created:
date modified:
2023-12-06T07:22:54Z
main entity:
{"identifier":"Q3115479","url":"https://www.wikidata.org/entity/Q3115479"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/0c/HoltGraph.svg","width":512,"height":512}
fields total:
13
integrity:
14