On the Zagreb indices of overfull molecular graphs

Abstract

Let G be a connected graph on n vertices. An overfull graph is a graph whose number of its edges is greater than Δ × [n/2], where Δ is the maximum degree of vertices in G. In this paper, we compute the Zagreb indices of overfull molecular graphs.