Tight estimates for eigenvalues of regular graphs (Q1883695): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:02, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight estimates for eigenvalues of regular graphs |
scientific article |
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
