Encyclopedia
Wells graph

The Wells graph is the unique distance-regular graph
with intersection array
Its spectrum is
. Its queue number is 3 and an upper bound on its book thickness is 5.
Sources and credits
This article is adapted from the Wikipedia article “Wells graph”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Images, from Wikimedia Commons:
- Wells graph.svg by Nathann.cohen, CC BY-SA 4.0
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.