Bounds and extremal graphs of second reformulated Zagreb index for graphs with cyclomatic number at most three

Abstract EN

Mili\v{c}evi\'{c} \textit{et al.}, in 2004, introduced topological indices known as Reformulated Zagreb indices, where they modified Zagreb indices using the edge-degree instead of vertex degree.

In this paper, we present a simple approach to find the upper and lower bounds of the second reformulated Zagreb index, $EM_2(G)$, by using six graph operations/transformations.

We prove that these operations significantly alter the value of reformulated Zagreb index.

We apply these transformations and identify those graphs with cyclomatic number at most 3, namely trees, unicyclic, bicyclic and tricyclic graphs, which attain the upper and lower bounds of second reformulated Zagreb index for graphs.