Ordering trees with n vertices and diameter d by their largest laplacian eigenvalues

被引：0

作者：

Guo, Shu-Guang ^{[1
]}

机构：

[1] Yancheng Teachers Coll, Dept Math, Yancheng 224002, Jiangsu, Peoples R China

来源：

UTILITAS MATHEMATICA | 2007年 / 74卷

关键词：

tree; diameter; laplacian eigenvalue;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The set of trees with n vertices and diameter d is denoted by T-n,T-d. In this paper, we give the first [d/2] trees in T-n,T-d ordered according to their largest Laplacian eigenvalues in decreasing order, and determine all trees in T,,d whose largest Laplacian eigenvalue is greater than n-d+1.

引用

页码：65 / 69

页数：5

共 8 条

[1] [Anonymous], J CHINA U SCI TECHNO
[2] [Anonymous], LINEAR ALGEBRA APPL
[3] On the Laplacian spectral radius of a tree
Guo, JM
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 368 : 379 - 385
[4] Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
Hong, Y
Zhang, XD
[J]. DISCRETE MATHEMATICS, 2005, 296 (2-3) : 187 - 197
[5] A note on Laplacian graph eigenvalues
Merris, R
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 285 (1-3) : 33 - 35
[6] Ordering trees by their Laplacian spectral radii
Yu, AM
Lu, M
Tian, F
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 405 : 45 - 59
[7] [袁西英 Yuan Xiying], 2004, [华东师范大学学报. 自然科学版, Journal of East China Normal University.Natural Science], P13
[8] 郭曙光, 2001, [高校应用数学学报. A辑, Applied Mathematics: A Journal of Chinese Universities], V16, P131

← 1 →