The Maximum Sum-Balaban Index of Tree Graph with Given Vertices and Maximum Degree
Abstract: In this paper, by using the graph operation, we determine the extremal graph which attains the maximum Sum-Balaban index among trees with given vertices and maximum degree.
文章引用: 游志福 , 韩 函 (2013) 给定顶点和最大度树图的最大Sum-Balaban指标。 应用数学进展， 2， 147-151. doi: 10.12677/AAM.2013.24019
 Balaban, A.T., Khadikar, P.V. and Aziz, S. (2010) Comparison of topological indices based on iterated “sum” versus “product” operations. Iranian Journal of Mathematical Chemistry, 1, 43-67.
 Deng, H. (2011) On the Sum-Balaban index. MATCH Communications in Mathematical and in Computer Chemistry, 66, 273-284.
 Xing, R., Zhou, B. and Grovac, A. (2012) On Sum-Balaban index. Ars Combinatoria, 104, 211-223.
 You, L. and Han, H. (2013) The maximum Sum-Balaban index of trees with given diameter. Ars Combinatoria, Accepted.
 Dong, H. and Guo, X. (2011) Character of trees with extreme Balaban index. MATCH Communications in Mathematical and in Computer Chemistry, 66, 261-272.