摘要
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 ≥ 2i ＋ 2 with the largest Laplacian spectral radius.
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 ≥ 2i ＋ 2 with the largest Laplacian spectral radius.
基金
Supported by the National Natural Science Foundation of China (Grant No.10871204)
