5 views

1 Answers

The Wells graph is the unique distance-regular graphwith intersection array { 5 , 4 , 1 , 1 ; 1 , 1 , 4 , 5 } {\displaystyle \{5,4,1,1;1,1,4,5\}}..

Its spectrum is 5 1 5 8 1 1 0 8 5 {\displaystyle 5^{1}{\sqrt {5}}^{8}1^{1}0^{8}^{5}}. Its queue number is 3 and its upper bound on the book thickness is 5.

5 views

Related Questions

What is Archimedean graph?
1 Answers 5 Views
What is Heawood graph?
1 Answers 6 Views
What is Grassmann graph?
1 Answers 5 Views
What is Reeb graph?
1 Answers 4 Views
What is Diamond graph?
1 Answers 5 Views
What is Biconnected graph?
1 Answers 4 Views
What is Ladder graph?
1 Answers 4 Views
What is Half-transitive graph?
1 Answers 4 Views
What is Wells of Toledo?
1 Answers 4 Views