Sharp lower bounds on the eigenvalues of trees (Q1123213): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3907599 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inverses of trees / rank | |||
Normal rank | |||
Latest revision as of 09:01, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp lower bounds on the eigenvalues of trees |
scientific article |
Statements
Sharp lower bounds on the eigenvalues of trees (English)
0 references
1989
0 references
It is proved that the smallest positive eigenvalue in a forest with n vertices is bounded from below by the same eigenvalue in a path with \(2\lfloor n/2\rfloor\) vertices. With some exceptions (which are described), the second largest eigenvalue of a tree is not smaller than 1.
0 references
eigenvalue
0 references
forest
0 references
