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 -regular graphs. We also prove an analogue of Serre's theorem regarding the least eigenvalues of -regular graphs: given , there exist a positive constant and a nonnegative integer such that for any -regular graph with no odd cycles of length less than , the number of eigenvalues of such that is at least . This implies a result of Winnie Li.
The author gives elementary proofs of results of Serre and Li on extreme eigenvalues of regular graphs.
Cites work
- Eigenvalues and expanders
- scientific article; zbMATH DE number 1210372 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 823142 (Why is no real title available?)
- On negative eigenvalues of regular graphs
- On the second eigenvalue of a graph
- Ramanujan graphs
- Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝
- Some geometric aspects of graphs and their eigenfunctions
- Spectra of hypergraphs and applications
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- The expected eigenvalue distribution of a large regular graph
- Tight estimates for eigenvalues of regular graphs
Cited in
(18)- Extremal properties of eigenvalues for a metric graph.
- Tight estimates for eigenvalues of regular graphs
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
- Eigenvalues of Cayley graphs
- On the order of regular graphs with fixed second largest eigenvalue
- Some observations on the smallest adjacency eigenvalue of a graph
- Median eigenvalues and the HOMO-LUMO index of graphs
- Eigenvalues of graphs and a simple proof of a theorem of Greenberg
- Closed walks and eigenvalues of abelian Cayley graphs
- Maximizing the order of a regular graph of given valency and second eigenvalue
- Fixation and escape times in stochastic game learning
- Expander graphs and their applications
- Explicit bounds from the Alon-Boppana theorem
- A spectral Erdős-Rademacher theorem
- Cubic graphs with no eigenvalues in the interval (-1,1)
- Limit vectors of the top k eigenvalues of d-regular graphs
- Eigenvalues and forbidden subgraphs. I.
- Extreme eigenvalues of nonregular 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)