On the largest eigenvalue of a tree with perfect matchings (Q1402067): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00746-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053708463 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 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
