On the ABC index of connected graphs with given degree sequences

The atom-bond connectivity (ABC) index of a graph G is defined to be ABC(G)=∑uv∈E(G)d(u)+d(v)-2d(u)d(v) where d(u) is the degree of a vertex u. The ABC index plays a key role in correlating the physical–chemical properties and the molecular structures of some families of compounds. In this paper, we describe the structural properties of graphs which have the minimum ABC index among all connected graphs with a given degree sequence. Moreover, these results are used to characterize the extremal graphs which have the minimum ABC index among all unicyclic and bicyclic graphs with a given degree sequence.