Sharp lower bounds on the eigenvalues of trees (Q1123213): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90288-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013867978 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 March 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
