Wells graph

From HandWiki
Revision as of 19:53, 6 February 2024 by QCDvac (talk | contribs) (add)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Wells graph
Wells graph.svg
Vertices32
Edges80
Radius4
Diameter4
Girth5
Automorphisms1920
Chromatic number4
Chromatic index5
Queue number3
PropertiesDistance regular
Hamiltonian
Table of graphs and parameters

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

Its spectrum is [math]\displaystyle{ 5^1 \sqrt{5}^8 1^10 (-\sqrt{5})^8(-3)^5 }[/math]. Its queue number is 3 and an upper bound on its book thickness is 5.[2]

References

  1. Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-Regular Graphs, Springer-Verlag, Theorem 9.2.9 
  2. Jessica Wolz, Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018

External links