Eigenvalues of graphs and a simple proof of a theorem of Greenberg
Let \(\rho(\tilde X)\) be the spectral radius of the universal cover \(\widetilde X\) of a finite graph \(X\). The author shows that for a given \(\eta>0\), there exists a positive constant \(c=c(X,\eta)\) such that for each finite graph \(Y\) covered by \(X\) it holds that \(| \{\lambda\in\text{ spectrum of }Y: \lambda\geq\rho(X)-\eta\}| \geq c| V(Y)| \). This represents a slight improvement over the result of Greenberg who proved it for \(| \lambda| \geq\rho(X)-\eta\). A similar result regarding the smallest eigenvalue is also proved.
- A lower bound on the spectral radius of the universal cover of a graph
- A proof of alon's second eigenvalue conjecture
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Eigenvalues and expanders
- Finite common coverings of graphs
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 782054 (Why is no real title available?)
- scientific article; zbMATH DE number 823142 (Why is no real title available?)
- Not every uniform tree covers Ramanujan graphs
- On the extreme eigenvalues of regular graphs.
- Ramanujan graphs
- Relative expanders or weakly relatively 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
- The spectral radius of the Galois covering of a finite graph
- Relative expanders or weakly relatively Ramanujan graphs.
- Ramanujan coverings of graphs
- Ramanujan complexes and golden gates in \(PU(3)\)
- On the local geometry of graphs in terms of their spectra
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem
- Explicit bounds from the Alon-Boppana theorem
- scientific article; zbMATH DE number 1894778 (Why is no real title available?)
- A lower bound on the spectral radius of the universal cover of a graph
This page was built for publication: Eigenvalues of graphs and a simple proof of a theorem of Greenberg
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496648)