Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Holt graph

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.

Overview & Gallery

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Holt graph. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Automorphisms
54
Book thickness
3
Chromatic index
5
Chromatic number
3
Diameter
3
Edges
54

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Gallery

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Holt graph

Nodes20
Edges19
Triples17
Avg. degree1.9
Density0.1
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Holt graph

Top relations

related to Gallery · 4
Holt graph → Hamiltonian, Holt, The, The Holt
Automorphisms · 1
Holt graph → 54
Book thickness · 1
Holt graph → 3
Chromatic index · 1
Holt graph → 5
Chromatic number · 1
Holt graph → 3
Diameter · 1
Holt graph → 3
Edges · 1
Holt graph → 54
Girth · 1
Holt graph → 5
Named after · 1
Holt graph → Derek F. Holt
Properties · 1
Holt graph → Vertex-transitive Edge-transitive Half-transitive Hamiltonian Eulerian Cayley graph

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

graph holt number chromatic hamiltonian vertices edges symmetric index vertex-transitive edge-transitive doyle also group half-transitive diameter girth graphs named derek

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Holt graphAutomorphisms541.00infobox
Holt graphBook thickness31.00infobox
Holt graphChromatic index51.00infobox
Holt graphChromatic number31.00infobox
Holt graphDiameter31.00infobox
Holt graphEdges541.00infobox
Holt graphGirth51.00infobox
Holt graphNamed afterDerek F. Holt1.00infobox
Holt graphPropertiesVertex-transitive Edge-transitive Half-transitive Hamiltonian Eulerian Cayley graph1.00infobox
Holt graphQueue number31.00infobox
Holt graphRadius31.00infobox
Holt graphVertices271.00infobox
Holt graphis aunit distance graph0.90text

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.