from Part IV - The Shrikhande Graph in Context
Published online by Cambridge University Press: 05 June 2026
In this chapter, we use the classification of the root systems with all roots of the same length to determine the graphs G whose adjacency matrix A(G) has least eigenvalue −2 or larger. This classification includes the Shrikhande graph and gives us another, quite different, proof of Shrikhande’s Theorem.
Note that if G is a graph with at least one edge, then the sum of the eigenvalues of A(G) is zero (the trace of A(G)), and hence G has both positive and negative eigenvalues. So, for non-null graphs, the smallest eigenvalue is negative.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.