Sharp lower bounds on the Laplacian eigenvalues of trees (Q1827487)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sharp lower bounds on the Laplacian eigenvalues of trees |
scientific article; zbMATH DE number 2083498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp lower bounds on the Laplacian eigenvalues of trees |
scientific article; zbMATH DE number 2083498 |
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
0.8823973536491394
0 references
0.8819135427474976
0 references
0.8698179721832275
0 references
0.8695891499519348
0 references
0.8556933999061584
0 references
