Complexity of Topological Indices: The Case of Connective Eccentric Index

作者：Alizadeh Yaser^*; Klavzar Sandi

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2016, 76(3): 659-667.

Let I be a summation-type topological index and let G be a graph. The I-complexity C-I(G) of G is introduced as the number of different contributions to I(G) in its summation formula. The complexity is studied in the case of the connective eccentric index xi(Ce) For any d >= 2 and for any k >= 1, a graph G with diam(G) = d and C-xi ce(G) = k is constructed. Graphs with C-xi ce (G) = 1 are studied and infinite families of such graphs that are not vertex-transitive are constructed. A cut-method theorem for the vertex eccentricity is also developed.

• 出版日期2016