Note on the Reformulated Zagreb Indices of Two Classes of Graphs

Abstract EN

The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of its two end vertices minus 2.

In this paper, we obtain two upper bounds of the first reformulated Zagreb index among all graphs with p pendant vertices and all graphs having key vertices for which they will become trees after deleting their one key vertex.

Moreover, the corresponding extremal graphs which attained these bounds are characterized.