Sharp lower bounds on the eigenvalues of trees (Q1123213)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp lower bounds on the eigenvalues of trees |
scientific article; zbMATH DE number 4108820 |
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
0.8769096732139587
0 references
0.8737105131149292
0 references
0.8698179721832275
0 references
0.864260196685791
0 references
