On the extreme eigenvalues of regular graphs.

From MaRDI portal
Publication:2490837



Abstract: In this paper, we present an elementary proof of a theorem of Serre concerning the greatest eigenvalues of k-regular graphs. We also prove an analogue of Serre's theorem regarding the least eigenvalues of k-regular graphs: given epsilon>0, there exist a positive constant c=c(epsilon,k) and a nonnegative integer g=g(epsilon,k) such that for any k-regular graph X with no odd cycles of length less than g, the number of eigenvalues mu of X such that muleq−(2−epsilon)sqrtk−1 is at least c|X|. This implies a result of Winnie Li.


The author gives elementary proofs of results of Serre and Li on extreme eigenvalues of regular graphs.











This page was built for publication: On the extreme eigenvalues of regular graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490837)