Ordering Trees with Fixed Order and Matching Number by Laplacian Spectral Radius  

作　　者：Shang Wang TAN 

机构地区：[1]College of Mathematics and Computational Science, China University of Petroleum, Shandong 257061, P. R. China

出　　处：《Journal of Mathematical Research and Exposition》2011年第3期381-392,共12页数学研究与评论（英文版）

基　　金：Supported by the National Natural Science Foundation of China (Grant No.10871204)

摘　　要：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.

关 键 词：TREE MATCHING Laplacian spectral radius. 

分 类 号：O157.5[理学—数学] O151.21[理学—基础数学]