Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k-dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k-domination number [Formula: see text] of G is the minimum cardinality among all distance k-dominating sets of G. The first Zagreb index of G is defined as ...

In this paper, a novel eccentric neighborhood degree-based topological indices, termed Zagreb have been conceptualized and its discriminating power investigated with regard to the predictability of boiling point chemical substances. The indices was compared that Wiener connectivity indices. Some explicit results for those new some graphs graph operations such as join, disjunction, composition, ...