Abstract
In this Note we prove that if {Gn} is a sequence of connected k-regular graphs in which the length of odd cycles approaches infinity as n→∞, then the limsup of the smallest eigenvalue of Gn greater than -k is at most -2k-1 as n tends to infinity.
Translated title of the contribution | On negative eigenvalues of regular graphs |
---|---|
Original language | French |
Pages (from-to) | 907-912 |
Number of pages | 6 |
Journal | Comptes Rendus de l'Academie des Sciences - Series I: Mathematics |
Volume | 333 |
Issue number | 10 |
DOIs | |
State | Published - Nov 2001 |
All Science Journal Classification (ASJC) codes
- Mathematics(all)