Harries–Wong graph

HarriesWong graph
The HarriesWong graph
Named afterW. Harries,
Pak-Ken Wong
Vertices70
Edges105
Radius6
Diameter6
Girth10
Automorphisms24 (S4)
Chromatic number2
Chromatic index3
Genus9
Book thickness3
Queue number2
PropertiesCubic
Cage
Triangle-free
Hamiltonian
Table of graphs and parameters

In the mathematical field of graph theory, the HarriesWong graph is a 3-regular undirected graph with 70 vertices and 105 edges.

The HarriesWong graph has chromatic number 2, chromatic index 3, radius 6, diameter 6, girth 10 and is Hamiltonian. It is also a 3-vertex-connected and 3-edge-connected non-planar cubic graph. It has book thickness 3 and queue number 2.

The characteristic polynomial of the Harries–Wong graph is