On the largest \(k\)th eigenvalues of trees (Q1893111): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Spektren endlicher Grafen / 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: The kth 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: Sharp lower bounds on the eigenvalues of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on graph eigenvalues / rank | |||
Normal rank | |||
Latest revision as of 14:08, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the largest \(k\)th eigenvalues of trees |
scientific article |
Statements
On the largest \(k\)th eigenvalues of trees (English)
0 references
13 May 1996
0 references
The paper contains some contributions to the study of best possible upper bounds for the \(k\)th largest eigenvalue of trees on \(n\) vertices. The problem was previously settled unless \(n \equiv 0 \pmod k\) and \(k > 1\). The author solves the problem for \(k = 2, 3, 4, 5\).
0 references
eigenvalue of trees
0 references
