Wells graph

From testwiki
Revision as of 20:54, 15 May 2024 by imported>Xvshh (Undid revision 1224022197 by Xvshh (talk))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Infobox graph

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

Its spectrum is 5158110(5)8(3)5. Its queue number is 3 and an upper bound on its book thickness is 5.[2]

References

Template:Reflist

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