Sharp lower bounds on the Laplacian eigenvalues of trees
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.
scientific article; zbMATH DE number 2083498