Wells graph
From Wikipedia, the free encyclopedia
Page Template:Infobox graph/styles.css has no content.Page Module:Infobox/styles.css has no content.
| Wells graph | |
|---|---|
| Lua error in package.lua at line 80: module 'Module:InfoboxImage/data' not found. | |
| 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 | |
The Wells graph is the unique distance-regular graph with intersection array [1]
Its spectrum is . Its queue number is 3 and an upper bound on its book thickness is 5.[2]
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.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
