On the Zagreb indices of overfull molecular graphs
نویسندگان
1 Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran
doi
10.22061/jmns.2014.482چکیده
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.