Tight estimates for eigenvalues of regular graphs

zbMath1053.05082MaRDI QIDQ1883695

Noga Alon

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124017

zbMATH Keywords

eigenvaluesadjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (15)

Eigenvalues of Cayley graphs ⋮ Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On spectral radii of unraveled balls ⋮ A note on pseudorandom Ramsey graphs ⋮ Expander graphs and their applications ⋮ Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs ⋮ On the order of regular graphs with fixed second largest eigenvalue ⋮ Explicit Bounds from the Alon–Boppana Theorem ⋮ Maximizing algebraic connectivity for certain families of graphs ⋮ On the extreme eigenvalues of regular graphs. ⋮ Closed walks and eigenvalues of abelian Cayley graphs ⋮ A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue ⋮ Ramsey numbers involving an odd cycle and large complete graphs in three colors

This page was built for publication: Tight estimates for eigenvalues of regular graphs