Wells graph
| 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 | |
The Wells graph is the unique distance-regular graph with intersection array . .[1]
Its spectrum is . Its queue number is 3 and its upper bound on the book thickness is 5.[2]
