On the largest eigenvalue of a tree with perfect matchings

被引:15
作者
Chang, A [1 ]
机构
[1] Fuzhou Univ, Dept Math, Fujian 350002, Peoples R China
关键词
tree; perfect matching; characteristic polynomial; eigenvalue; upper bound;
D O I
10.1016/S0012-365X(02)00746-X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The set of trees with n vertices and the set of trees with perfect matchings are denoted by F-n and T-2k, respectively. M. Hofmeister determined the first five maximum value of the largest eigenvalue of trees in F-n and gave the corresponding trees (Linear Algebra Appl. 260 (1997) 43-59). Focusing on the largest eigenvalue of trees in T-2k, this paper will give the first seven maximum value of that of trees in T-2k and their corresponding trees. In other words, an order of trees in T-2k by their largest eigenvalues is extended to the seventh position. (C) 2002 Elsevier B.V. All rights reserved.
引用
收藏
页码:45 / 63
页数:19
相关论文
共 15 条
[1]  
CHANG A, 1998, LINEAR ALGEBRA APPL, V283, P247
[2]  
CHANG A, 1998, THESIS SICHUAN U
[3]  
CVETKOVIC D, 1981, ALGEBRA METHODS GRAP, V1, P47
[4]  
Cvetkovic D.M., 1980, SPECTRA GRAPH THEORY
[5]   INVERSES OF TREES [J].
GODSIL, CD .
COMBINATORICA, 1985, 5 (01) :33-39
[6]  
Hofmeister M, 1997, LINEAR ALGEBRA APPL, V260, P43, DOI 10.1016/S0024-3795(96)00249-2
[7]   THE 2ND LARGEST EIGENVALUE OF A TREE [J].
NEUMAIER, A .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1982, 46 (AUG) :9-25
[8]  
Schwenk A.J., 1978, SELECTED TOPICS GRAP
[9]  
Shao J.Y., 1991, SCI B, V18, P1361
[10]   BOUNDS ON THE KTH EIGENVALUES OF TREES AND FORESTS [J].
SHAO, JY .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 149 :19-34