INDICES OF TREES WITH A PRESCRIBED DIAMETER

被引：8
|
作者：
Simic, Slobodan K. [1 ,3 ]
Zhou, Bo [2 ]
机构：
[1] Math Inst SANU, Belgrade 11001, Serbia
[2] S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
[3] Fac Comp Sci, Belgrade 11000, Serbia
来源：
APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS | 2007年 / 1卷 / 02期
基金：
中国国家自然科学基金;
关键词：
Tree; diameter; spectrum; characteristic polynomial; index;
D O I：
10.2298/AADM0702446S
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The index of a graph is is the largest eigen value of its adjacency matrix. Let T-n,T-d be the class of trees with n vertices and diameter d. For all integers n and d with 4 <= d <= n - 3 we identify in T-n,T-d the tree with the k-th largest index for all k up to left perpendiculard/2right perpendicular + 1 if d <= n - 4, or for all k up to left perpendiculard/2right perpendicular if d = n - 3.
引用
收藏
页码：446 / 454
页数：9
相关论文
共 50 条
12345