Wells_graph

Wells graph

Wells graph

Add article description

The Wells graph is the unique distance-regular graph with intersection array [1]

Quick Facts Vertices, Edges ...

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

References

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

This article uses material from the Wikipedia article Wells_graph, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.