Wells graph
The Wells graph is the unique distance-regular graph with intersection array . .[1]
| Wells graph | |
|---|---|
 | |
| Vertices | 32 |
| Edges | 80 |
| Radius | 4 |
| Diameter | 4 |
| Girth | 5 |
| Automorphisms | 1920 |
| Chromatic number | 4 |
| Chromatic index | 5 |
| Queue number | 3 |
| Properties | Distance regular Hamiltonian |
| Table of graphs and parameters | |
Its spectrum is . Its queue number is 3 and its upper bound on the book thickness is 5.[2]
References
- Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-regular graphs, Springer-Verlag, Theorem 9.2.9
- Jessica Wolz, Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.