The Wells graph is the unique
distance-regular graph
with intersection array
.
.
Its spectrum is
. Its
queue number
In the mathematical field of graph theory, the queue number of a graph is a graph invariant defined analogously to stack number (book thickness) using first-in first-out (queue) orderings in place of last-in first-out (stack) orderings.
Defin ...
is 3 and its upper bound on the
book thickness
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings into a ''book'', a collection of half-planes all having the same line as their boundary. Usually, the vertices of the graph are required to lie o ...
is 5.
[Jessica Wolz, ''Engineering Linear Layouts with SAT''. Master Thesis, University of Tübingen, 2018]
References
{{Reflist
External links
A.E. Brouwer's website: The Armanios-Wells graph
Individual graphs
Regular graphs