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]
Laupäev, aprill 05, 2025
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]