Bounds on the largest eigenvalues of trees with a given size of matching

被引:83
|
作者
Hou, YP [1 ]
Li, JS
机构
[1] Hunan Normal Univ, Dept Math, Changsha 410081, Hunan, Peoples R China
[2] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
tree; matching; the largest eigenvalue of a graph; upper bound;
D O I
10.1016/S0024-3795(01)00465-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Very little is known about upper bound for the largest eigenvalue of a tree with a given size of matching. In this paper, we find some upper bounds for the largest eigenvalue of a tree in terms of the number of vertices and the size of matchings, which improve some known results. (C) 2002 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:203 / 217
页数:15
相关论文
共 50 条