Ordering trees by their largest eigenvalues (Q5906986)
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 1970617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordering trees by their largest eigenvalues |
scientific article; zbMATH DE number 1970617 |
Statements
Ordering trees by their largest eigenvalues (English)
0 references
25 August 2003
0 references
Let the set of trees on \(n\) vertices be ordered by the largest eigenvalue (of the adjacency matrix) of trees in non-increasing order. First eight trees in this order are determined. The first five trees were identified earlier in a paper by \textit{M. Hofmeister} [Linear Algebra Appl. 260, 43-59 (1997; Zbl 0876.05068)].
0 references
tree
0 references
characteristic polynomial
0 references
eigenvalue
0 references
upper bound
0 references
0.9009909629821776
0 references
0.8980745673179626
0 references
0.8549277186393738
0 references
0.8262670040130615
0 references
0.8116319179534912
0 references
