Wells graph

Wells graph

Vertices	32
Edges	80
Radius	4
Diameter	4
Girth	5
Automorphisms	1920
Chromatic number	4
Chromatic index	5
Properties	Distance regular Hamiltonian

The Wells graph is the unique distance-regular graph with intersection array $\{5,4,1,1;1,1,4,5\}$ . .^[1]

Its spectrum is $5^{1}{\sqrt {5}}^{8}1^{1}0(-{\sqrt {5}})^{8}(-3)^{5}$ .

References

↑ Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-regular graphs, Springer-Verlag, Theorem 9.2.9

This article is issued from Wikipedia - version of the 10/30/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.