Trees with minimal index and diameter at most four

被引：6
作者：
Belardo, Francesco [1 ]
Li Marzi, Enzo M. [1 ]
Simic, Slobodan K. [2 ]
机构：
[1] Univ Messina, Dept Math, I-98166 Messina, Italy
[2] Math Inst SANU, Belgrade 11001, Serbia
来源：
DISCRETE MATHEMATICS | 2010年 / 310卷 / 12期
关键词：
Graph eigenvalues; Graph index; Trees; Diameter;
D O I：
10.1016/j.disc.2009.11.022
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we consider the trees with fixed order n and diameter d <= 4. Among these trees we identify those trees whose index is minimal. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：1708 / 1714
页数：7
相关论文
共 8 条
[1]  
[Anonymous], 1997, Eigenspaces of graphs
[2]  
BELARDO F, 2006, THESIS U MESSINA ITA
[3]   Some results on the index of unicyclic graphs [J].
Belardo, Francesco ;
Li Marzi, Enzo Maria ;
Simic, Slobodan K. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 416 (2-3) :1048-1059
[4]  
Cvetkovic D., 1995, Spectra of Graphs: Theory and Applications
[5]  
Cvetkovic D., 1990, Linear Multilinear Algebra, V28, P3, DOI DOI 10.1080/03081089008818026
[6]  
Harary F., 1969, Graph Theory
[7]   The minimal spectral radius of graphs with a given diameter [J].
van Dam, E. R. ;
Kooij, R. E. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 423 (2-3) :408-419
[8]  
Wang Y, 2003, SYM REL DIST SYST, P25
1