Sharp lower bounds on the Laplacian eigenvalues of trees (Q1827487): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:56, 1 February 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
