Reformulated First Zagreb Index of Some Graph Operations

The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of the end vertices of the edge minus 2. In this paper, we study the behavior of the reformulated first Zagreb index and apply our results to different chemically interesting molecular graphs and nano-structures.


Suppose
denotes the class of all graphs, then a function T : → R + is known as a topological index if for every graph H isomorphic to G, T (G) = T (H).Different topological indices are found to be useful in isomer discrimination, structure-property relationship, structure-activity relationship, pharmaceutical drug design, etc. in chemistry, biochemistry and nanotechnology.Suppose G is a simple connected graph and V (G) and E(G) respectively denote the vertex set and edge set of G. Let, for any vertex v ∈ V (G), d G (v) denotes its degree, that is the number of neighbors of v. Let n vertices of G be denoted by v 1 , v 2 , ...., v n .If the edges of G are (v 1 , v 2 ), (v 2 , v 3 )....(v n−1 , v n ), (v n−1 , v n ) then the graph is called a path graph and is denoted by P n .The wheel graph, denoted by W n , is obtained by adding a new vertex to the cycle C n and connects this new vertex to each vertex of C n .Similarly, a fan graph F n , is obtained by adding a new vertex to the path graph P n and connects this new vertex to each vertex of P n .The first and second Zagreb indices of a graph, denoted by M 1 (G) and M 2 (G) are among the oldest, most popular and most extensively studied vertex-degree-based topological indices.These indices were introduced Gutman and Trinajstić in a paper in 1972 [1] to study the structure-dependency of the total π-electron energy (ε) and are respectively defined as These indices are extensively studied in (chemical) graph theory.Interested readers are referred to [2,3] for some recent reviews on the topic.Milićević et al. [4] reformulated the Zagreb indices in terms of edge degrees instead of vertex degrees, where the degree of an edge e = uv is defined as d(e) = d(u) + d(v) − 2. Thus, the reformulated first and second Zagreb indices of a graph G are defined as where e ∼ f means that the edges e and f share a common vertex in G, i.e., they are adjacent.Different mathematical properties of reformulated Zagreb indices have been studied in [5].In [6], Ilić et al., establish further mathematical properties of the reformulated Zagreb indices.In [7], bounds for the reformulated first Zagreb index of graphs with connectivity at most k are obtained.De [8] found some upper and lower bounds of these indices in terms of some other graph invariants and also derived reformulatrd Zagreb indices of a class of dendrimers [9].Ji et al. [10,11] computed these indices for acyclic, unicyclic, bicyclic and tricyclic graphs.
Graph operations play a very important role in mathematical chemistry, since some chemically interesting graphs can be obtained from some simpler graphs by different graph operations.In [12], Khalifeh et al., derived some exact expressions for computing first and second Zagreb indices of some graph operations.Ashrafi et al. [13] derived explicit expressions for Zagreb coindices of different graph operations.Das et al. [14] derived some upper bounds for multiplicative Zagreb indices of different graph operations.Azari and Iranmanesh [15], presented explicit formulae for computing the eccentric-distance sum of different graph operations.In [16] and [17], the present authors obtained some bounds and exact formulae for the connective eccentric index and for F-index of different graph operations.There are several other papers concerning topological indices of different graph operations.For more results on topological indices of different graph operations, interested readers are referred to the papers [18][19][20][21][22].
In this paper we present some exact expressions for the reformulated first Zagreb index of different graph operations such as join, Cartesian product, composition, corona product, splice and link of graphs.Also we apply our results by specializing components of these graph operations to compute the reformulated first Zagreb index for some important classes of molecular graphs and nano-structures.

Main Results
In this section, we study the reformulated first Zagreb index under join, Cartesian product, composition, corona product, link and splice of graphs.All these operations are binary, and the join and Cartesian product of graphs are commutative operations, whereas the composition and corona product operations are noncommutative.All the graphs considered here are connected, finite and simple.Let G 1 and G 2 be two simple connected graphs, so that their vertex sets and edge sets are represented as V (G i ) and E(G i ) respectively, for i ∈ {1, 2}.

The Join of Graphs
The join G 1 + G 2 is the union G 1 ∪ G 2 together with all the edges joining each vertex of V (G 1 ) to each vertex of V (G 2 ).The degree of a vertex v of G 1 + G 2 is given by In the following theorem we compute the reformulated first Zagreb index of the join of two graphs.
Theorem 1.The reformulated first Zagreb index of G 1 + G 2 is given by Proof of Theorem 1.We have where J 1 , J 2 and J 3 denote the sums of the above terms in order.Next we calculate J 1 , J 2 and J 3 separately. Similarly, Finally, Adding J 1 , J 2 and J 3 , we get the desired result.
Example 1.The complete bipartite graph K p,q is defined as join of Kp and Kq , so that, from Theorem 1, its reformulated first Zagreb index is given by EM The suspension of a graph G is defined as G+K 1 .Thus the reformulated first Zagreb index of a graph is calculated as follows.
Corollary 2. The suspension of a graph G is given by Example 2. The fan graph F n on (n + 1) vertices is the suspension of P n .So, using Corollary 2, its reformulated first Zagreb index is calculated as Example 3. The wheel graph W n on (n + 1) vertices is the suspension of C n .So, its reformulated first Zagreb index is given by Example 4. The Dutch windmill graph or flower graph is the suspension of m copies of K 2 , denoted by mK 2 .So its reformulated first Zagreb index is calculated as

The Cartesian Product of Graphs
Let G 1 and G 2 be two connected graphs.The Cartesian product of G 1 and G 2 , denoted by In the following theorem we obtain the reformulated first Zagreb index of the Cartesian product of two graphs.
Proof of Theorem 3. We have, where A 1 and A 2 denote the sums of the above terms in order.Next we calculate A 1 and A 2 separately one by one.Now, Similarly, By adding A 1 and A 2 , the desired result follows after simple calculation.
Let P n (n ≥ 1) and C n (n ≥ 3) be path and cycle of order n respectively, then we have Example 5.The Ladder graph L n , made by n square and 2n + 2 vertices is the Cartesian product of P 2 and P n+1 , so the reformulated first Zagreb index of L n is given by EM Example 8.The reformulated first Zagreb index of the grids (P n × P m ) is given by Example 9.The n-prism is defined as the Cartesian product of K 2 and C n .The reformulated first Zagreb index of the n-prism is given by EM Example 10.The rook's graph is defined as the Cartesian product of two complete graphs, say K n and K m .So, the reformulated first Zagreb index of the rook's graph is given by

Composition
This operation is also termed the lexicographic product.The composition of two graphs G 1 and G 2 is denoted by G 1 [G 2 ] and any two vertices (u 1 , u 2 ) and (v 1 , v 2 ) are adjacent if and only if In the following theorem we compute the reformulated first Zagreb index of the composition of two graphs.
Proof of Theorem 4. We have where C 1 and C 2 denote the sums of the above terms in order.Next we calculate C 1 and C 2 separately.Now, Also,

Splice of Graphs
A splice of G 1 and G 2 was introduced by Doslić [23].Let y ∈ V (G 1 ) and z ∈ V (G 2 ) be two given vertices of G 1 and G 2 respectively.The splice of two graphs G 1 and G 2 at the vertices y and z is denoted by (G 1 • G 2 )(y, z) and is obtained by identifying the vertices y and z in the union of , where we denote the vertex obtained by identifying y and z by v 12 .From the construction of the splice of two graphs it is clear that Let N (v) denotes the set of vertices which are the neighbors of the vertex v, so that i.e., sum of degrees of the neighbor vertices of G.In the following theorem we obtain the reformulated first Zagreb index of the splice of two graphs.
Theorem 5.The reformulated first Zagreb index of splice of graphs G 1 and G 2 is given by Proof of Theorem 5. We have, from the definition of the reformulated first Zagreb index From the above, after simple computation, the desired result follows.

Link of Graphs
A link of G 1 and G 2 at the vertices y and z is denoted by (G 1 ∼ G 2 )(y, z) and is obtained by joining the vertices y and z in the union of G 1 and G 2 .From the construction of link graphs, it is clear that In the following theorem we obtain the reformulated first Zagreb index of the link of two graphs.Theorem 6.The reformulated first Zagreb index of link of graphs G 1 and G 2 is given by Proof of Theorem 6.From the definition of the reformulated first Zagreb index, we have From the above, we get the desired result after simple computation.

Corona Product of Graphs
The corona product G 1 G 2 of two graphs is obtained by taking one copy of G 1 and n 1 copies of G 2 ; and by joining each vertex of the i-th copy of G 2 to the i-th vertex of G 1 , where Clearly, the corona product operation of two graphs is not commutative.Different topological indices of the corona product of two graphs have already been studied in [24,25].Let the vertices of G 1 be denoted by V (G 1 ) = u 1 , u 2 , ..., u |V (G 1 )| and the vertices of the i-th copy of G 2 are denoted by In the following, we compute the reformulated first Zagreb index of the corona product of two graphs.
Theorem 7. The reformulated first Zagreb index of G 1 G 2 is given by , for i = 1, 2, ..., n 1 .So the contribution of these type of edges to the reformulated first Zagreb index of G 1 G 2 is Next, we calculate the reformulated first Zagreb index of some particular bridge graphs.Let G 1 , G 2 , ..., G n be a set of finite pairwise disjoint graphs.The bridge graph with respect to the vertices v 1 , v 2 , ..., v n , denoted by B(G 1 , G 2 , ..., G n ; v 1 , v 2 , ..., v n ) is the graph obtained by connecting the vertices v i and v i+1 of G i and G i+1 by an edge for all i = 1, 2, ..., (n − 1).If G 1 ∼ = G 2 ∼ = ... ∼ = G n and v 1 = v 2 = ... = v n = v, we define G n (G, v) = B(G, G, ..., G; v, v, ..., v).In particular, B n = G n (P 3 , v) and T n,k = G n (C k , u) are two special types of bridge graphs.Then, from the definition of the corona product of graphs, B n ∼ = P n K 2 and T n,3 ∼ = P n K 2 .Using Theorem 7, the reformulated first Zagreb index of these bridge graphs are obtained as follows.

Conclusions
In this paper, we have studied the reformulated first Zagreb index of different graph operations.Also, we applied our results to calculate the reformulated first Zagreb index of some classes of graphs by specializing the components of graph operations.Nevertheless, there are still many other graph operations and special classes of graphs that are not covered here.For further research, the second reformulated Zagreb index various graph operations can be computed.
Now combining C 1 and C 2 , on simplification, the reformulated first Zagreb index of G 1 [G 2 ] is obtained as above.Example 11.The fence graph and closed fence graph are defined as P n [P 2 ] and C n [P 2 ].So, from Theorem 4, the reformulated first Zagreb index of these graphs are given by (i) EM 1 (P n [P 2