On the kth Laplacian eigenvalues of trees with perfect matchings

Let be the set of all trees of order n with perfect matchings. In this paper, we prove that for any tree , its kth largest Laplacian eigenvalue μk(T) satisfies μk(T)=2 when n=2k, and when n≠2k. Moreover, this upper bound is sharp when .