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 after | W. Harries |
Vertices | 70 |
Edges | 105 |
Radius | 6 |
Diameter | 6 |
Girth | 10 |
Automorphisms | 120 (S5) |
Chromatic number | 2 |
Chromatic index | 3 |
Book thickness | 3 |
Queue number | 2 |
Properties | Cubic 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.