Tight estimates for eigenvalues of regular graphs (Q1883695)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight estimates for eigenvalues of regular graphs |
scientific article; zbMATH DE number 2107514
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight estimates for eigenvalues of regular graphs |
scientific article; zbMATH DE number 2107514 |
Statements
Tight estimates for eigenvalues of regular graphs (English)
0 references
13 October 2004
0 references
Summary: It is shown that if a \(d\)-regular graph contains \(s\) vertices so that the distance between any pair is at least \(4k\), then its adjacency matrix has at least \(s\) eigenvalues which are at least \(2\sqrt{d-1}\cos({\pi\over 2k})\). A similar result has been proved by Friedman using more sophisticated tools.
0 references
adjacency matrix
0 references
eigenvalues
0 references
0 references
0 references
0.9242276
0 references
0.9240618
0 references
0 references
0.9178748
0 references
0.91732544
0 references
0.9167317
0 references
0 references
0.9149792
0 references
