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

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2002年 / 342卷 / 1-3期

基金：

中国国家自然科学基金;

关键词：

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

共 8 条

[1] Bounds on the second largest eigenvalue of a tree with perfect matchings
An, C
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 283 (1-3) : 247 - 255
[2] Bondy J. A., 1976, Graph theory with applications
[3] CVETKOVIC D, 1990, LINEAR MULTILINEAR A, V28, P3, DOI DOI 10.1080/03081089008818026
[4] Cvetkovic D. M., 1980, Spectra of Graphs-Theory and Application
[5] Hofmeister M, 1997, LINEAR ALGEBRA APPL, V260, P43, DOI 10.1016/S0024-3795(96)00249-2
[6] Li Qiao, 1979, Acta Mathematicae Applacatae Sinica, V2, P167
[7] Shao J.Y., 1991, SCI B, V18, P1361
[8] XU GH, 1997, COMBINATORICS GRAPH

← 1 →