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.
机构:
Northwestern Polytech Univ, Sch Math & Stat, Xian 710129, Shaanxi, Peoples R ChinaNorthwestern Polytech Univ, Sch Math & Stat, Xian 710129, Shaanxi, Peoples R China
Xi, Fangxu
Wang, Ligong
论文数: 0引用数: 0
h-index: 0
机构:
Northwestern Polytech Univ, Xian Budapest Joint Res Ctr Combinator, Xian 710129, Shaanxi, Peoples R ChinaNorthwestern Polytech Univ, Sch Math & Stat, Xian 710129, Shaanxi, Peoples R China
机构:
Qinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China
Huazhong Normal Univ, Coll Math & Stat, Wuhan, Hubei, Peoples R ChinaQinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China
Ye, Chengfu
Hu, Zhiquan
论文数: 0引用数: 0
h-index: 0
机构:
Huazhong Normal Univ, Coll Math & Stat, Wuhan, Hubei, Peoples R ChinaQinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China
机构:
Hunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R ChinaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
Deng, Hanyuan
Balachandran, S.
论文数: 0引用数: 0
h-index: 0
机构:
SASTRA Univ, Sch Human & Sci, Dept Math, Thanjavur, IndiaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
Balachandran, S.
Venkatakrishnan, Y. B.
论文数: 0引用数: 0
h-index: 0
机构:
SASTRA Univ, Sch Human & Sci, Dept Math, Thanjavur, IndiaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
Venkatakrishnan, Y. B.
Balachandar, S. Raja
论文数: 0引用数: 0
h-index: 0
机构:
SASTRA Univ, Sch Human & Sci, Dept Math, Thanjavur, IndiaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China