Maryam Jalali-Rad - Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran

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

overfull graph, Zagreb indices, Molecular graph