From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
The Wells graph is the unique distance-regular graph
with intersection array
{
5
,
4
,
1
,
1
;
1
,
1
,
4
,
5
}
.
{\displaystyle \{5,4,1,1;1,1,4,5\}.}
[1]
Its spectrum is
5
1
5
8
1
10
(
−
5
)
8
(
−
3
)
5
{\displaystyle 5^{1}{\sqrt {5}}^{8}1^{10}(-{\sqrt {5}})^{8}(-3)^{5}}
. Its queue number is 3 and an upper bound on its book thickness is 5.[2]
References
^ Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-Regular Graphs , Springer-Verlag, Theorem 9.2.9
^ Jessica Wolz, Engineering Linear Layouts with SAT . Master Thesis, University of Tübingen, 2018
External links