A note on the eigenvalues of graphs

被引：0

作者：

Feng, Lihua ^{[1
]}

Yu, Guihai ^{[1
]}

机构：

[1] Shandong Inst Business & Technol, Sch Math, Yantai 264005, Shandong, Peoples R China

来源：

ARS COMBINATORIA | 2010年 / 94卷

关键词：

Bounds; Eigenvalues; Laplacian eigenvalues; BOUNDS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this note, we present some upper bounds for the kth largest eigenvalue of the adjacency matrix as well as the Laplacian matrix of graphs. Special attention is paid to the Laplacian matrix of trees.

引用

页码：221 / 227

页数：7

共 18 条

[1] [Anonymous], LINEAR ALGEBRA APPL
[2] [Anonymous], J CHINA U SCI TECHNO
[3] Bondy J. A., 1976, Graph theory with applications
[4] BOUNDS ON GRAPH SPECTRA
BRIGHAM, RC
DUTTON, RD
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (03) : 228 - 234
[5] Cvetkovic D. M., 1980, Spectra of graphs
[6] SOME EIGENVALUE PROPERTIES IN GRAPHS (CONJECTURES OF GRAFFITI .2.)
FAVARON, O
MAHEO, M
SACLE, JF
[J]. DISCRETE MATHEMATICS, 1993, 111 (1-3) : 197 - 220
[7] Gernert D., private communication
[8] Godsil CD, 1999, ACH-MODELS CHEM, V136, P503
[9] A note on the kth eigenvalue of trees
Guo, JM
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 413 (01) : 148 - 154
[10] On the second largest Laplacian eigenvalue of trees
Guo, JM
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 404 : 251 - 261

← 1 2 →