| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602426 | Linear Algebra and its Applications | 2010 | 6 Pages |
Abstract
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 .
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
