On the connectivity index of trees

被引：0
作者：
Yue Jiang
Mei Lu
机构：
[1] Tsinghua University,Department of Mathematical Sciences
来源：
Journal of Mathematical Chemistry | 2008年 / 43卷
关键词：
Connectivity index; Tree; Diameter;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The connectivity index χ1(G) of a graph G is the sum of the weights d(u)d(v) of all edges uv of G, where d(u) denotes the degree of the vertex u. Let T(n, r) be the set of trees on n vertices with diameter r. In this paper, we determine all trees in T(n, r) with the largest and the second largest connectivity index. Also, the trees in T(n, r) with the largest and the second largest connectivity index are characterized.
引用
收藏
页码：955 / 965
页数：10
相关论文
共 27 条
[1]  
Bollobás B.(1998)undefined Ars Combin. 50 225-233
[2]  
Erdös P.(2000)undefined Ars Combin. 54 223-235
[3]  
Clark L.H.(2001)undefined J. Serb. Chem. Soc. 66 605-611
[4]  
Moon J.W.(1975)undefined J. Chem. Phys. 62 3399-3405
[5]  
Gutman I.(1972)undefined Chem. Phys. Lett. 17 535-538
[6]  
Lepović M.(2004)undefined MATCH Commu. Math. Comput. Chem. 51 155-166
[7]  
Gutman I.(2004)undefined MATCH Commun. Math. Comput. Chem. 50 57-62
[8]  
Ruscić B.(2006)undefined Disc. Appl. Math. 154 106-109
[9]  
Trinajstić N.(2004)undefined MATCH Commun. Math. Comput. Chem. 51 149-154
[10]  
Gutman I.(1992)undefined J. Chem. Educ. 69 701-702
123