Wells graph explained

Wells graph
Vertices:32
Edges:80
Automorphisms:1920
Radius:4
Diameter:4
Girth:5
Chromatic Number:4
Chromatic Index:5
Properties:Distance regular
Hamiltonian
Queue Number:3

The Wells graph is the unique distance-regular graphwith intersection array

\{5,4,1,1;1,1,4,5\}.

Its spectrum is

51\sqrt{5}8110(-\sqrt{5})8(-3)5

. Its queue number is 3 and an upper bound on its book thickness is 5.[1]

External links

Notes and References

  1. Jessica Wolz, Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018