Graphs having the maximal value of the szeged index

被引:1
作者
Dobrynin, AA
机构
关键词
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The Szeged index is a new topological. index based on distances between the vertices of a graph. The conjecture of Klavzar, Rajapakse and Gutman concerning graphs with the maximal value of the Szeged index is proved. More precisely, a complete bipartite graph K-[p/2],K-[(p+1/2]) has the maximum Szeged index among all the connected graphs on p vertices.
引用
收藏
页码:819 / 825
页数:7
相关论文
共 18 条
[1]  
Bollobas B., 1978, EXTREMAL GRAPH THEOR, P297
[2]  
Dobrynin A., 1994, Publ. Inst. Math. (Beograd), V56, P18
[3]  
Dobrynin A. A., 1995, Graph Theory Notes N. Y., V28, P21
[4]  
Dobrynin AA, 1996, CROAT CHEM ACTA, V69, P845
[5]   A WIENER-TYPE GRAPH INVARIANT FOR SOME BIPARTITE GRAPHS [J].
DOBRYNIN, AA ;
GUTMAN, I ;
DOMOTOR, G .
APPLIED MATHEMATICS LETTERS, 1995, 8 (05) :57-62
[6]  
DOBRYNIN AA, 1997, IN PRESS MATCH, V35
[7]  
Gutman I., 1995, J SERB CHEM SOC, V60, P759, DOI DOI 10.1016/0893-9659(96)00071-7
[8]  
GUTMAN I, 1996, B ACAD SERBE SCI SMN, V111, P19
[9]  
Gutman I., 1994, Graph Theory Notes N. Y., V27, P9