The first general Zagreb coindex of graph operations

Many chemically important graphs can be obtained from simpler graphs by applying different graph operations. Graph operations such as union, sum, Cartesian product, composition and tensor product of graphs are among the important ones. In this paper, we introduce a new invariant which is named as the first general Zagreb coindex and defined as M1 (G) = ∑uv∈E(G)[dG(u) α + dG(v) ] ,where α ∈ R,α 6= 0. Here, we study the basic properties of the newly introduced invariant and its behavior under some graph operations such as union, sum, Cartesian product, composition and tensor product of graphs and hence apply the results to find the first general Zagreb coindex of different important nano-structures and molecular graphs.


Introduction
The branch of mathematical chemistry which deals in the study of chemical graphs is called chemical graph theory. Chemical graphs are models of molecules in which atoms are represented by vertices and chemical bonds by the edges of the graph. Chemical graph theory is useful to study various physico-chemical properties of molecules by using the information encoded in their corresponding chemical graphs. The study is achieved by considering various graph-theoretical invariants of molecular graphs (also known as topological indices or molecular descriptors). Topological indices are mathematical procedures which transforms chemical information encoded within a symbolic representation of a molecule into a useful numbers. The useful numbers can give more insight into the interpretation of the molecular properties and also predicts some interesting property of other molecules.
A graph invariant is any function on a graph that does not depend on a labeling of its vertices. Here, we introduce an invariant, the first general Zagreb coindex. The formal definition of the first generale Zagreb coindex, basic properties and main results are given in sections 2,3 and 4 respectively.

Definitions and preliminaries
For convenience of our discussion, we first recall some relevant terminology and notations. In this paper, all the graphs are simple and finite. For any concepts and terms not defined here we recommend the reader to any standard monographs such as [1,2]. Let G be a finite simple graph on n vertices and m edges. The vertex set and edge set of G are denoted respectively by V (G) and E(G). The complement of a graph G which is denoted by G is the simple graph with the same vertex set V (G) and any two vertices uv ∈ E(G) if and only if uv / ∈ E(G).
. We next list the definitions of some topological indices with which we are particularly concerned in this paper. The first (M 1 ) and second (M 2 ) Zagreb indices are the oldest and most thoroughly studied degree based topological indices. These indices were introduced in (1972) by Gutman and Trinajstić [8] with in a study of the structure-dependency of the total π-electron energy (ε) where approximate formulas for the total π -electron energy (ε) were obtained. These indices provide a measure of branching of the carbon-atom skeleton. These quantities are defined as In [8] another degree based topological index which is also a measure of branching was also introduced but it was not studied further. After more than 40 years, Furtula and Gutman [9] re-initiated and establish some basic properties of it. This index is denoted by F(G) and named as forgotten topological index or F-index. It is defined as Li and Zheng [10] introduced the concept of the first general Zagreb index M α 1 (G) of G as follows: where, α = 0, 1 and α ∈ R. Obviously, when α = 2 it gives first Zagreb index and when α = 3 we obtain F-index. If G has n vertices and m edges, then it is known that M 0 1 (G) = n and M 1 1 (G) = 2m (hand shaking lemma.) By taking the contributions of non adjacent pairs of vertices into consideration, the first (M 1 ) and second (M 2 ) Zagreb coindices were introduced by Došlic [11] while computing weighted Winner Polynomial of some composite graphs. In this case the sum runs over the edges of the complement of G. They are defined as and De et al. [19] introduced the F-coindex of a graph G, denoted by F, and testifying that F-coindex can predict the logarithm of octanol-water partition coefficient (log(P)) values with high accuracy. It is defined as Motivated by the first Zagreb coindex and F-coindex, we introduce a coindex in a more general form, called the first general Zagreb coindex and defined as follows: The reader should note that the defining sums in (2.1) run over E(G) but the degrees are with respect to G. Clearly, when α = 1 it gives first Zagreb coindex (M 1 ) and when α = 2 it gives F-coindex (F). Obviously, if α = 0 then M 0 1 (G) = 2m. There are many chemically important graphs which are obtained from simpler graphs by applying different graph operations. To mention a few, the Cartesian product of a path and a cycle produces a C 4 nanotube, the Cartesian product of two cycles produce the C 4 nanotorus and using the products of two paths we obtain rectangular grids, composition of a path and cycle with K 2 produces open and closed fences respectively etc... Hence, it is vital to understand how certain invariants of such composite graphs are related to their corresponding invariants as well as with other related invariants. So far, several studies on different graph invariants under different graph operations have been studied. Graovac and Pisanski [13] derived exact formula for the Wiener index of the Cartesian product of graphs. Khalifeh et al. [14] computed some exact formulae for computing first and second Zagreb indices under some graph operations. Azari and Iranmanesh [15] presented explicit formulas for computing the eccentric-distance sum of different graph operations. De et al. presented the reformulated Zagreb index of graph operations in [7] and the F-index of some graph operations in [12]. Many other results concerning various topological indices under different graph operations are available in the literature and for details we refer the reader to see [3][4][5][6]16,[21][22][23]. Beside to this, there are few studies on the coindex version of invariants under different graph operations. In [17] Ashrafi et al. derived some explicit formulae of Zagreb coindices under some graph operations. De et al. [19] presented the F-coindex of some graph operation and Basavanagoud and Patil [20] computed hyper Zagreb coindex of some graph operations. Here, we continue this line of research by exploring the behavior of the newly introduced first general Zagreb coindex under some important graph operations such as union, sum, Cartesian product, tensor product and composition.
3 Basic properties Proposition 1. Let G be a connected graph of order n with degree sequence π = (d 1 , Proof. Since every vertex d i (i = 1, 2, ..., n) has (n − 1 − d i ) non adjacent vertices, the result follows immediately.
Proposition 2. Let G be a simple graph of order n and size m. Then M Proof. By proposition 1, From the definition (2.1) or proposition 1, the first general Zagreb coindex acheive the smallest possible value of 0 on the complete and on the empty graphs. In case of complete graph, all the degrees are n − 1 and in the case of empty graphs, all the degrees are zero.
Proposition 3. For any complete graph and empty graph of order n, we have The following results for paths and cycles on n vertices can be easily obtained by using direct calculations.
Proposition 4. For any path and cycle of order n we have

Main results
In this section, we study the first general Zagreb coindex of some graph operations such as union, sum, Cartesian product, composition, and tensor product of graphs. For more information on composite graphs we refer the reader to monograph [18]. All considered graph operations are binary. For a given graph G i , we use the notations V (G i ) for the set of vertex, E(G i ) for the set of edge, n i for the cardinality of V (G i ), m i for the cardinality of E(G i ) and m i for the cardinality of edges in the graph G i . When more than two graphs can be combined using a given operation, the values of subscripts will vary accordingly. Here, we consider five operations and each of them is treated in a separate subsection.
Proposition 5. Let G i (i = 1, 2) be simple graph with order n i (i = 1, 2). Then M Proof. The degree of a vertex u of G 1 ∪ G 2 is equal to the degree of the component G i (i = 1, 2) that contains it. So ∀u ∈ V (G 1 ∪ G 2 ), we have So, by using proposition 1, The union operation can be extended inductively to more than two graphs in an obvious way. Let G i (i = 1, 2, . . . , p) be graphs with vertex sets V i and edge sets E i of cardinality n i and m i , respectively. Their union is a graph G 1 ∪ G 2 ∪ . . . ∪ G p on the vertex set V 1 ∪ . . . ∪ V p and the edge set E 1 ∪ E 2 ∪ . . . ∪ E p . By starting from Propoaition 5, deduce induction on p, we can obtain the following result for the first general Zagreb coindex of the union of several graphs.

Sum
The sum of two graphs with disjoint vertex sets V 1 and V 2 is the graph denoted by G 1 + G 2 with the vertex set V (G 1 ) ∪V (G 2 ) and edge set E(G 1 ) ∪ E(G 2 ) ∪ {u 1 u 2 : u 1 ∈ V 1 , u 2 ∈ V 2 }. Thus, the sum of two graphs is obtained by connecting each vertex of one graph to each vertex of the other graph, while keeping all the edges of both graphs. Here also, |V (G 1 ∪ G 2 )| = n 1 + n 2 . Proposition 6. Let G i (i = 1, 2) be simple graphs and α ∈ N. Then, Proof. From the definition of sum of two graphs, the degree of a vertex u of G 1 + G 2 is given by By using proposition 1,

Now,
Similarly, we get Combining A and B, we get the desired result.
The complete bipartite graph K p,q (p, q ≥ 2) is sum of two empty graphs K p and K q . Thus, by using proposition 6 and result in proposition 3 (ii) we give an explicit formulae below.
]. The suspension graph of G is defined as sum of G with K 1 . Thus, from proposition 6, we obtain the following result.
Corollary 4.3. The first general Zagreb coindex of suspension of G is given by For example, the wheel graph W n on (n + 1) vertices, the fan graph F n on (n + 1) vertices and the star graph S n on n vertices are suspensions of the graphs C n , P n and K n−1 respectively. Thus, by using corollary 3 we get the following results in Example 1.
The sum operation can also be extended to more than two graphs. Let G i (i = 1, 2, . . . , p) be graphs with vertex sets V i and edge sets E i of cardinality n i and m i , respectively. Their sum is a graph ∑ Therefore, for α ∈ N, the first general Zagreb coindex of the sums of graphs ∑ p i=1 G i is given as in the following proposition. Proposition 7. Let G i (i = 1, 2, . . . , p) be simple graphs and α ∈ N. Then, The complete p-partite graph K n 1 ,··· ,n p with partition classes of size n i is a sum of p empty graphs K n i (i = 1, · · · , p). So by proposition 7, we obtain a formula for M α 1 (K n 1 ,··· ,n p ). In particular when all classes are of equal size, say q, i.e in the case of balanced complete p-partite graph on p · q vertices, its first general Zagreb coindex is given by

Cartesian product
The Cartesian product of two graphs G 1 and G 2 which is denoted by G 1 × G 2 , is the graph with vertex set V (G 1 ) × V (G 2 ) and any two vertices (u 1 , Obviously, |V (G 1 × G 2 )| = n 1 n 2 and |E(G 1 × G 2 )| = n 1 m 2 + n 2 m 1 . Proposition 8. Let G i (i = 1, 2) be simple graph and α ∈ N. Then Proof. From the definition of Cartesian product, the degree of vertex (a, b) of G 1 ×G 2 is given by By using proposition 1, we have

Now,
Similarly, we obtain Subtracting B from A, we get the desired result.
The rectangular grid, the C 4 nanotube (TUC 4 (r, q)) and the C 4 nanotorus (TC 4 (r, q)) are isomorphic to the Cartesian products (P r × P q ), (P r ×C q ), and (C r ×C q ) respectively. Thus, as an application we present formulae for the first general Zagreb coindx of these structures and obtained from proposition 8 after certain steps of simplifications.

Tensor product
The tensor product of two graphs G 1 and G 2 is denoted by G 1 ⊗ G 2 is the graph with vertex set V (G 1 ) × V (G 2 ) and any two vertices (u 1 , u 2 ) and (v 1 , v 2 ) are adjacent if and only if u 1 v 1 ∈ E(G 1 ) and u 2 v 2 ∈ E(G 2 ). Here, |V (G 1 ⊗ G 2 )| = n 1 n 2 .
However, in the above proposition 11, the expression is incorrect. Consider figure below as a counter example. P 3 : By proposition 11, M 1 (P 2 [P 3 ]) = 20. Where as by definition (2.1) or proposition 1, we obtain M 1 (P 2 [P 3 ]) = 16 (as it is the first Zagreb coindex we use α = 1). Clearly they are not equal. The following corollary gives the correct version of proposition 11 and obtained by substituting α = 1 in proposition 10.  The following corollary corrects some errors in Corollary 19 of [17].

Conclusion
In this paper, we have introduced an invariant called the first general Zagreb coindex and studied its basic properties and obtained explicit formula for the values under some graph operations. The results are also applied to find the first general Zagreb coindex of some special and chemically interesting graphs. However, there are still many other graph operations and special classes of graphs which are not covered here. Thus, for further research, the first general Zagreb coindex of other graph operations as well as determining extremal values of the first general Zagreb coindx over various classes of graphs shall be considered. In particular, if α = 1 (resp. α = 2) is substituted in all the results of this paper, it gives the first Zagreb coindex (resp. the F-coindex) of those studied graph operations.
T h i s p a g e i s i n t e n t i o n a l l y l e f t b l a n k