On the two largest eigenvalues of trees (Q1361770)
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 1040488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the two largest eigenvalues of trees |
scientific article; zbMATH DE number 1040488 |
Statements
On the two largest eigenvalues of trees (English)
0 references
25 November 1997
0 references
Very little is known about upper bounds for the largest eigenvalue of a tree that depend only on the number of vertices. Starting from the classical upper bound for the largest eigenvalue, some refinements can be obtained by successively removing trees from consideration. The results can be used to characterize those trees that maximise the second largest eigenvalue. This corrects a result in the literature, and it includes a proof of a conjecture of Neumaier. The main tool for this endeavour is the theory of partial eigenvectors.
0 references
eigenvalue
0 references
tree
0 references
conjecture of Neumaier
0 references
0.8854449987411499
0 references
0.8421768546104431
0 references
0.8388732671737671
0 references
0.8354684710502625
0 references
