On the largest eigenvalue of a tree with perfect matchings (Q1402067): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the largest eigenvalue of a tree with perfect matchings |
scientific article |
Statements
On the largest eigenvalue of a tree with perfect matchings (English)
0 references
19 August 2003
0 references
Let the set of trees on \(n\) vertices with a perfect matching be ordered by the largest eigenvalue (of the adjacency matrix) of trees in non-increasing order. The first seven trees in this order are determined.
0 references
Tree
0 references
Perfect matching
0 references
Characteristic polynomial
0 references
Eigenvalue
0 references
Upper bound
0 references
