Sharp lower bounds on the Laplacian eigenvalues of trees (Q1827487): 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/j.laa.2004.01.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087268502 / rank | |||
Normal rank | |||
Revision as of 20:54, 19 March 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
