Harries graph

In the mathematical field of graph theory, the Harries graph or Harries (3-10)-cage is a 3-regular, undirected graph with 70 vertices and 105 edges.

Harries graph
The Harries graph
Named afterW. Harries
Vertices70
Edges105
Radius6
Diameter6
Girth10
Automorphisms120 (S5)
Chromatic number2
Chromatic index3
Book thickness3
Queue number2
PropertiesCubic
Cage
Triangle-free
Hamiltonian
Table of graphs and parameters

The Harries 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 graph is

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.