Wells graph
From Wikipedia, the free encyclopedia
The Wells graph is the unique distance-regular graph with intersection array [1]
Its spectrum is . Its queue number is 3 and an upper bound on its book thickness is 5.[2]
References
External links
Wikiwand - on
Seamless Wikipedia browsing. On steroids.