Ordering trees by their largest eigenvalues (Q5906986): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the two largest eigenvalues of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The second largest eigenvalue of a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on the \(k\)th eigenvalues of trees and forests / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the spectral radius of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the largest eigenvalue of a tree with perfect matchings / rank | |||
Normal rank | |||
Latest revision as of 09:18, 6 June 2024
scientific article; zbMATH DE number 1970617
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
