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.
机构:
NW Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Gansu, Peoples R ChinaNW Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Gansu, Peoples R China
机构:
Shanghai Univ, Dept Math, Shanghai, Peoples R China
Jiangxi Normal Univ, Coll Math & Informat Sci, Nanchang, Jiangxi, Peoples R ChinaShanghai Univ, Dept Math, Shanghai, Peoples R China
Su, Li
Kang, Liying
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Dept Math, Shanghai, Peoples R ChinaShanghai Univ, Dept Math, Shanghai, Peoples R China
Kang, Liying
Li, Honghai
论文数: 0引用数: 0
h-index: 0
机构:
Jiangxi Normal Univ, Coll Math & Informat Sci, Nanchang, Jiangxi, Peoples R ChinaShanghai Univ, Dept Math, Shanghai, Peoples R China
Li, Honghai
Shan, Erfang
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Sch Management, Shanghai 200444, Peoples R ChinaShanghai Univ, Dept Math, Shanghai, Peoples R China