On the adjacent eccentric distance sum index of graphs

Abstract

For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as ξ sv (G) = ∑ vεV(G) ε(v)D(v) deg(v), where D(v) = ∑ uεV(G) d(u, v) is the sum of all distances from the vertex v. In this paper we derive some bounds for the adjacent eccentric distance sum index in terms of some graph parameters, such as independence number, covering number, vertex connectivity, chromatic number, diameter and some other graph topological indices. Copyright: