Abstract
There is a tremendous amount of literature about the second-largest eigenvalue of a regular graph. If the gap between the largest and second-largest eigenvalues is large, then the graph has good connectivity, expansion and randomness properties. (About connectivity, see also §1.7.)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Andries E. Brouwer and Willem H. Haemers
About this chapter
Cite this chapter
Brouwer, A.E., Haemers, W.H. (2012). The Second-Largest Eigenvalue. In: Spectra of Graphs. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1939-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1939-6_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-1938-9
Online ISBN: 978-1-4614-1939-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)