Sharp lower bounds on the Laplacian eigenvalues of trees (Q1827487): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An improved upper bound for Laplacian graph eigenvalues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Laplacian Spectrum of a Graph II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Laplacian spectral radius of a tree. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the second largest eigenvalue of the laplacian matrix of a graph<sup>∗</sup> / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounding the largest eigenvalue of trees in terms of the largest vertex degree / rank | |||
Normal rank | |||
Revision as of 18:21, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp lower bounds on the Laplacian eigenvalues of trees |
scientific article |
Statements
Sharp lower bounds on the Laplacian eigenvalues of trees (English)
0 references
6 August 2004
0 references
The author proves sharp lower bounds on the largest and the second largest eigenvalue of the Laplacian matrix of a tree in terms of the vertex degrees and the average degree of neighbors of a vertex and characterizes the cases of equality.
0 references
Laplacian matrix
0 references
largest eigenvalue
0 references
second largest eigenvalue
0 references
tree
0 references
