Robertson–Wegner graph
| Robertson-Wegner graph | |
|---|---|
| Named after | Neil Robertson |
| Vertices | 30 |
| Edges | 75 |
| Diameter | 3 |
| Girth | 5 |
| Automorphisms | 20 |
| Chromatic number | 4 |
| Chromatic index | 5[1] |
| Properties | Cage |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Robertson-Wegner graph or (4,5)-cage, is a 5-regular undirected graph with 30 vertices and 75 edges named after Neil Robertson and G. Wegner.[2][3]
The Robertson-Wegner graph is one of the four (5,5)-cage graphs.
It has chromatic number 4, diameter 3, and is 5-vertex-connected.
Algebraic properties
The characteristic polynomial of the Robertson-Wegner graph is
References
- ^ Weisstein, Eric W. "Class 2 Graph". MathWorld.
- ^ Weisstein, Eric W. "Robertson Graph". MathWorld.
- ^ Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 238, 1976.