| Ordering Trees with Fixed Order and Matching Number by Laplacian Spectral Radius |
| Received:July 25, 2009 Revised:January 19, 2010 |
| Key Words:
tree matching Laplacian spectral radius.
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant No.10871204). |
|
| Hits: 2438 |
| Download times: 2165 |
| Abstract: |
| Let $T(n,i)$ be the set of all trees with order $n$ and matching number $i$. We determine the third to sixth trees in $T(2i 1,i)$ and the third to fifth trees in $T(n,i)$ for $n\geq 2i 2$ with the largest Laplacian spectral radius. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2011.03.001 |
| View Full Text View/Add Comment |
