On Generalized Atom-bond Connectivity Index of Cacti

Abstract

The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for  ABCa index for cacti of order $n$ with fixed number of cycles and for cacti of order $n$ with given number of pendant vertices. Furthermore, we identify all the cacti that achieve the bounds.