Bounds on the second largest eigenvalue of a tree with perfect matchings

被引：7

作者：

An, C ^{[1
]}

机构：

[1] Fuzhou Univ, Dept Mat Sci, Fujian 350002, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1998年 / 283卷 / 1-3期

关键词：

tree; perfect matching; eigenvalue; bound;

D O I：

10.1016/S0024-3795(98)10107-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, an upper bound and a tight lower bound for the second largest eigenvalue of a tree with perfect matchings are obtained. At the same time, a lower bound for the maximum value of the second largest eigenvalue of trees with perfect matchings is also given. (C) 1998 Elsevier Science Inc. All rights reserved.

引用

页码：247 / 255

页数：9

共 8 条

[1]

CVETKOVIE DM, 1980, SPECTRA GRAPH THEORY

[2] INVERSES OF TREES [J].

GODSIL, CD .

COMBINATORICA, 1985, 5 (01) :33-39

[3]

HONG Y, 1989, LINEAR ALGEBRA APPL, V113, P101

[4] THE 2ND LARGEST EIGENVALUE OF A TREE [J].

NEUMAIER, A .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1982, 46 (AUG) :9-25

[5]

Shao J.Y., 1991, SCI B, V18, P1361

[6] BOUNDS ON THE KTH EIGENVALUES OF TREES AND FORESTS [J].

SHAO, JY .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 149 :19-34

[7]

XU GH, 1997, COMBINATORICS GRAPH

[8]

ZHANG FJ, 1984, J XINJIANG U NAT SCI, V3, P84

← 1 →