{"version":"1.0","type":"link","title":"Holt graph - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/0/0c/HoltGraph.svg/1280px-HoltGraph.svg.png","thumbnail_width":1280,"thumbnail_height":1280}