On the second largest Laplacian eigenvalue of trees

Very little is known about lower bounds and upper bounds for the second largest Laplacian eigenvalue of trees. This paper mainly gives a sharp upper bound for the second largest Laplacian eigenvalue of trees with perfect matchings. We also provide the smallest three values of the second largest Laplacian eigenvalue for any tree, and characterize the trees attaining those values.