Computing Reformulated First Zagreb Index of Some Chemical Graphs as an Application of Generalized Hierarchical Product of Graphs

Author(s): Nilanjan De1
1Department of Basic Sciences and Humanities (Mathematics), Calcutta Institute of Engineering and Management, Kolkata, India
Copyright © Nilanjan De. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

The generalized hierarchical product of graphs was introduced by L. Barrière et al. in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster product of graphs are obtained. Finally using the derived results the reformulated first Zagreb index of some chemically important graphs such as square comb lattice, hexagonal chain, molecular graph of truncated cube, dimer fullerene, zig-zag polyhex nanotube and dicentric dendrimers are computed.

Keywords: topological index, Zagreb index, reformulated Zagreb index, graph operations, composite graphs, generalized Hierarchical product.

1. Introduction

Let \(G\) be a simple connected graph with vertex set \(V(G)\) and edge set \(E(G)\). Let \(n\) and \(m\) respectively denote the order and size of \(G\). In this paper we consider only simple connected graph, that is, graphs without any self loop or parallel edges. In molecular graph theory, molecular graphs represent the chemical structures of a chemical compound and it is often found that there is a correlation between the molecular structure descriptor with different physico-chemical properties of the corresponding chemical compounds. These molecular structure descriptors are commonly known as topological indices which are some numeric parameter obtained from the molecular graphs and are necessarily invariant under automorphism. Thus topological indices are very important useful tool to discriminate isomers and also shown its applicability in quantitative structure-activity relationship (QSAR), structure-property relationship (QSPR) and nanotechnology including discovery and design of new drugs [1, 2].

Among different types of topological indices, the vertex degree based topological indices are very useful topological indices in study of structure property correlation of molecules. The degree of a vertex \(v\) of a graph \(G\) is equal to number of vertices adjacent with it and is denoted by \(d(v)\) whereas \(\delta (v)\) represents the sum of degrees of all the vertices adjacent to \(v\). The first and second Zagreb indices are the oldest vertex degree based topological indices and was introduced by Gutman and Trinajstić [3] and are defined as \[{{M}_{1}}(G)=\sum\limits_{v\in V(G)}{{{d}_{G}}{{(v)}^{2}}}=\sum\limits_{uv\in E(G)}{[{{d}_{G}}(u)+{{d}_{G}}(v)]}\] and \[{{M}_{2}}(G)=\sum\limits_{uv\in E(G)}{{{d}_{G}}(u){{d}_{G}}(v)}.\] These indices have been extensively studied both with respect to mathematical and chemical point of view. There are various extension of Zagreb indices. In [4], Miličević et al. Introduced a new version of Zagreb indices called reformulated Zagreb index. Here the degree of a vertex of classical Zagreb indices is replaced by degree of an edge \(e\) denoted by \(d(e)\), where the degree of an edge \(e=uv\) is given by \(d(u)+d(v)-2\). Therefore, the first and second reformulated Zagreb indices of a graph \(G\) are defined as \[{E}{{M}_{1}}(G)=\sum\limits_{e\in E(G)}{{d}{{(e)^2}}}=\sum\limits_{e=uv\in E(G)}{[{{d}_{G}}(u)+{{d}_{G}}(v)-{2}]^2},\] \[{E}{{M}_{2}}(G)=\sum\limits_{e \sim f\in E(G)}{{d}{{(e)}}{{d}{{(f)}}}}.\] In the definition of second reformulated Zagreb index, the notation \(e\sim f\) means that the edges \(e\) and \(f\) are adjacent, that is, they share a common vertex in \(G\). There are a large number of studies regarding various chemical and mathematical properties of the reformulated Zagreb indices. Different basic properties and bounds of reformulated Zagreb indices have been studied in [5] and [6]. 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 reformulated Zagreb indices of a class of dendrimers in [9]. Ji et al. in [10] and [11], computed these indices for acyclic, unicyclic, bicyclic and tricyclic graphs. Recently De et al. [12], investigate reformulated first Zagreb index of various graph operations.

We know that, different graph operations create a new graph from the given simpler graphs and sometimes it is found that, some chemically interesting graphs can be obtained as a result of graph operations of some simpler graphs. So from the relations obtained for different topological indices of graph operations in terms of topological indices of their components, it is convenient to find topological indices of some special molecular graphs and nanostructures. There are several study concerning topological indices of different graph operations. In [13], [14] and [15], De et al. obtained connective eccentric index, F-index and F-coindex of different graph operations respectively. Khalifeh et al., in [16] obtained some exact expressions for computing first and second Zagreb indices of different graph operations. In [18], Ashrafi et al. compute expressions for Zagreb coindices of different graph operations. In [18], Das et al. found some upper bounds for multiplicative Zagreb indices of some graph operations and Azari et al. in [19], derived explicit formulae for computing the eccentric-distance sum of different graph operations. Recently, De computes the vertex Zagreb indices of different graph operations in [20]. For more results, interested readers are referred to the papers [21, 22, 23, 24]. In this study, our goal is to study reformulated first Zagreb index of an important graph operation called generalized hierarchical product of graphs to obtain this topological index of different chemical graphs. Barrire et al. in 2009 introduced the generalized hierarchical product of graphs [25],which is a generalization of both Cartesian product of graphs and the (standard) hierarchical product of graphs [26]. There are various studies of generalized hierarchical product of graphs for different topological indices in recent literature [27, 28, 29, 30, 31].

In this paper, we first derive explicit expression of reformulated first Zagreb index of generalized hierarchical product of two connected graphs. Hence using the derived results, the reformulated first Zagreb index of some chemically important graphs such as square comb lattice, hexagonal chain, molecular graph of truncated cube, dimer fullerene etc. are obtained.

2. Generalized Hierarchical Product of Graphs

The generalized hierarchical product of graphs is one of most important graph operations as many other graph operations such as Cartesian product of graphs, cluster product of graphs can be considered as a special case of this graph operation. There are already various studies on different topological indices of this graph operation till date.

Definition 2.1. Let \(G\) and \(H\) be two connected graphs and \(U\) be a non-empty subset of \(V(H)\). Then the hierarchical product of \(G\) and \(H\), denoted by \(G\sqcap H(U)\), is the graph with vertex set \(V(G)\times V(H)\), and any two vertices \((u,v)\) and \(u^{\prime},v^{\prime}\) of \(G\sqcap H(U)\) are adjoint by an edge if and only if \([v=v^{\prime} \;\; \text{and} \;\; uu^{\prime}\in E(G)]\) or \([v=v^{\prime}\;\; \text{and} \;\; vv^{\prime}\in E(H)].\)

From definition, we can state the following lemma which gives some basic properties of generalized hierarchical product of graphs.

Lemma 2.2. Let \(G\) and \(H\) be graphs with \(U\subseteq V(H).\) Then

  1. \(G\sqcap H(U)\) is connected if and only if \(G\) and \(H\) are connected.
  2. The degree of a vertex \((a,x)\) of \(G\sqcap H(U)\) is given by \[{{d}_{{{G}_{U}}\sqcap{H}}}(a,x)= \left\{ \begin{array}{ll} {d}(x)+{χ}_{U}(x)d(a),~a\in V({{G}}),~x\in E(H)\\[2mm] d(x)+d(a),~a\in V(G),~x\in U\\[2mm] \end{array}\right.\]
where \(χ_{U}(x)\) is characteristic function on the set \(U,\) which is 1 on \(U\) and 0 outside \(U.\)

Now let us first derive the reformulated first Zagreb index of generalized hierarchical product of graphs \(G\) and \(H\).

Theorem 2.3. The reformulated first Zagreb index of \(G\sqcap H(U)\) is given by \begin{eqnarray*} EM_1(G\sqcap H(U))&=&|V(G)|EM_1(H)+|U|EM_1(G)+5M_1(G)\sum\limits_{u\in U}d(u)\\ &&+8|E(G)|\sum\limits_{u\in U}d(u)^2+2M_1(G)\{xy\in E(H): x,~y\in U\}\\ &&+4|E(G)|\sum\limits_{u\in U}\sum\limits_{x\in N[u]}d(x)-16|E(G)|\sum\limits_{u\in U}d(u). \end{eqnarray*}

Proof. Let \(G\) and \(H\) be two connected graphs and \(U\) be a nonempty subset of \(V(H)\). Let us partition the edge set of \(G\sqcap H(U)\) into two subsets, say \(E_1\) and \(E_2\) so that \[E_1=\{(a,x)(b,y): xy\in E(H)\;\; and\;\; a=b\in V(G)\}\] \[E_2=\{(a,x)(b,y): xy\in E(G)\;\; and\;\; x=y\in V(H)\}.\] Now using definition of reformulated first Zagreb index and generalized hierarchical product graph, we consider the following two cases to calculate the reformulated first Zagreb index of \(G\sqcap H(U)\).
Case 1. The contributions of the edges of \(H_1\) to the reformulated first Zagreb index of \(G\sqcap H(U)\) is calculated as \begin{eqnarray*} H_1&=&\sum\limits_{a\in V(G),xy\in E(H)}\{d(a,x)+d(a,y)-2\}^2\\ &=&\sum\limits_{a\in V(G),xy\in E(H)}\{d(x)+χ_{U}(x)d(a)+d(y)+χ_{U}(y)d(a)-2\}^2\\ &=&\sum\limits_{a\in V(G),xy\in E(H)}\{d(x)+d(y)-2\}^2\\&&+\sum\limits_{a\in V(G),xy\in E(H)}\{χ_{U}(x)d(a)+χ_{U}(y)d(a)\}^2\\ &&+2\sum\limits_{a\in V(G),xy\in E(H)}d(a)\{d(x)+d(y)-2\}\{χ_{U}(x)+χ_{U}(y)\}\\ &=&|V(G)|EM_1(H)+\sum\limits_{a\in V(G),xy\in E(H)}d(a)^2\{χ_{U}(x)^2+χ_{U}(y)^2\\ &&+2χ_{U}(x)χ_{U}(y)\}+2\sum\limits_{a\in V(G),xy\in E(H)}d(a)\{(χ_{U}(x)d(x)+χ_{U}(y)d(y))\\ &&+(χ_{U}(x)d(y)+χ_{U}(y)d(x))-2(χ_{U}(x)+χ_{U}(y))\}\\ &=&|V(G)|EM_1(H)+\sum\limits_{a\in V(G),xy\in E(H)}d(a)^2\{χ_{U}(x)^2+χ_{U}(y)^2\}\\ &&+2\sum\limits_{a\in V(G),xy\in E(H)}d(a)^2χ_{U}(x)χ_{U}(y)\\ &&+2\sum\limits_{a\in V(G),xy\in E(H)}d(a)\{χ_{U}(x)d(x)+χ_{U}(y)d(y)\}\\ &&+2\sum\limits_{a\in V(G),xy\in E(H)}d(a)\{χ_{U}(x)d(y)+χ_{U}(y)d(x)\}\\ &&-4\sum\limits_{a\in V(G),xy\in E(H)}d(a)\{χ_{U}(x)+χ_{U}(y)\}\\ &=&|V(G)|EM_1(H)+M_1(G)\sum\limits_{u\in U}d(u)+2M_1(G)|\{xy\in E(G) : x,y \in U\}|\\ &&+4|E(G)|\sum\limits_{u\in U}d(u)^2+4|E(G)|\sum\limits_{u\in U}\sum\limits_{x\in N[u]}d(x)-8|E(G)|\sum\limits_{u\in U}d(u). \end{eqnarray*} Case 2. Similarly, the contributions of the edges of \(H_2\) to the reformulated first Zagreb index of \(G\sqcap H(U)\) is calculated as. \begin{eqnarray*} H_2&=&\sum\limits_{ab\in E(G),x\in U}\{d(a,x)+d(b,x)-2\}^2\\ &=&\sum\limits_{ab\in E(G),x\in U}\{d(x)+d(a)+d(x)+d(b)-2\}^2\\ &=&\sum\limits_{ab\in E(G),x\in U}\{2d(x)+(d(a)+d(b)-2)\}^2\\ &=&4\sum\limits_{ab\in E(G),x\in U}d(x)^2+\sum\limits_{ab\in E(G),x\in U}\{d(a)+d(b)-2\}^2\\ &&+4\sum\limits_{ab\in E(G),x\in U}d(x)\{d(a)+d(b)\}-8\sum\limits_{ab\in E(G),x\in U}d(x). \end{eqnarray*} Finally, combining the contributions of \(H_1\) and \(H_2\), the desired result follows.

Now we consider reformulated first Zagreb index of a particular generalized hierarchical product graph, where \(G=P_2\), as some chemical structures are in this form.

Corollary 2.4. The reformulated first Zagreb index of cluster product of two graphs \(G\) and \(H\), with root vertex of degree one is given by \begin{eqnarray*} EM_1(P_2\sqcap H(U))&=&2EM_1(H)+8\sum\limits_{u\in U}d(u)^2-6\sum\limits_{u\in U}d(u)\\ &&+4|\{xy\in E(H): x,y\in U\}|+4\sum\limits_{u\in U}\sum\limits_{x\in N[u]}d(x). \end{eqnarray*} The Cartesian product of two graphs \(G\) and \(H\) denoted by \(G\times H\) is the graph with the vertex set \(V(G)\times(H)\), with vertices \(u=(u_1,u_2)\) and \(v=(v_1,v_2)\) connected by an edge if and only if \([u_1=v_1\; and\; (u_2,v_2)\in E(G_2)]\) or \([u_2=v_2\;\; and\;\; (u_1,v_1)\in E(G_1)].\) From definition it is clear that the generalized hierarchical product of graph is a subset of cartesian product of graphs. Also, if \(U=V(H)\), then \(G\sqcap H(U)=G\times H.\) Thus from Theorem 2.3 the following result follows:

Theorem 2.5. The reformulated first Zagreb index of Cartesian product of two graphs \(G\) and \(H\) is given by \begin{eqnarray*} EM_1(G\times H)&=&|V(G)|EM_1(H)+|V(H)|EM_1(G)+12|E(G)|M_1(H)\\ &&+12|E(H)|M_1(G)-32|E(G)||E(H)|. \end{eqnarray*}

Note that, the exact formula for reformulated first Zagreb index of the Cartesian product of graphs was obtained directly in [12], which coincides with the above result. For different special graphs obtained by specializing components of the cartesian product of graphs such as \(C_4\) nanotube \(P_n\times C_m,\) \(C_4\) nanotorus \(C_n\times C_m\), n-prism \(K_2\times C_n\), ladder graph \(P_2\times P_{n+1}\), grid graph \(P_n\times P_m\) rooks graph \(K_n\times K_m\) are discussed there in.

2.1. The cluster product of graphs

The cluster product of two graphs \(G\) and \(H\) denoted by \(G\{H\}\) is the graph obtained by taking one copy of \(G\) and \(V(G)\) copies of a rooted graph \(H\), and by identifying the root of the i-th copy of \(H\) with the i-th vertex of \(G,\) for \(i=1,2,….|V(G)|.\)

The cluster of two graphs \(G\) and \(H\) with root vertex \(x\), can be represented as a special case of generalized hierarchical product of graphs if \(U=\{x\}\), a singleton. Thus we have, \(G\sqcap H(U)=G\{H\}\). The cluster product of two graphs \(G\) and \(H\) with root \(x\) is also termed as (standard) hierarchical product and is denoted by \(G\sqcap (H=G\{H\})\). Thus we have, \(G\sqcap H(U)=G\{H\}=G\sqcap H\), if \(U=\{x\}\). Thus from Theorem 2.3, by considering \(U=\{x\}\), we get the following result directly.

Theorem 2.6. The reformulated first Zagreb index of cluster product of two graphs \(G\) and \(H\), with root vertex \(x\) of \(H\) is given by \begin{eqnarray*} EM_1(G\{H\})&=&|V(G)|EM_1(H)+EM_1(G)+5d(x)M_1(G)+8|E(G)|d(x)^2\\ &&+4|E(G)|\delta (x)-16|E(G)|d(x). \end{eqnarray*}

Let \(G=(V(G),E(G))\) be a \(r\)-regular graph, then \(d(x)=r,\) \(\delta (x)=r^2,\) \(M_1(G)=r^2|V(G)|\) and \(HM(G)=(2r-2)^2|E(G)|=2r(r-1)^2|V(G)|.\) Then the following result follows directly from above Theorem 2.6.

Corollary 2.7. If \(G\) and \(H\) be \(r\) and \(s\)-regular graph, respectively, then \[EM_1(G\{H\})=|V(G)|\{2s(s-1)^2|V(H)|+2r(r-1)^2+5r^2s+6rs^2-8rs\}.\]

Using the above result, the following example follows:

Example 2.8. \begin{eqnarray*} (i)~EM_1(C_n\{C_m\})&=&4n(m+15)\\ (ii)~EM_1(K_n\{K_m\})&=&n[2m(n-1)(n-2)^2+2(m-1)(m-2)^2\\ &&+5(n-1)^2(m-1)+6(n-1)(m-1)^2\\ &&-8(n-1)(m-1)]. \end{eqnarray*}

The \(t\)-thorny graph or the \(t\)-fold bristled graph of a graph \(G\) is obtained by joining \(t\) number of degree one vertices or thorn to each vertex of \(G\). This type of graph was introduced by Gutman [32] and studied by different authors also [33, 34, 35]. From construction it is clear that the \(t\)-thorny graph is the cluster product of \(G\) and a star graph \(S_{t+1}\), where the root vertex is the central vertex of \(S_{t+1}\) with degree \(t\). Hence, using Theorem 2.6 we get the following result.

Oorollary 2.9. Let \(G\) be a connected graph with \(n\) vertices and \(m\) edges, then \[EM_1(G\{S_{t+1}\})=EM_1(G)+5tM_1(G)+nt(t-1)^2+8mt^2-12mt.\]

We have derived the above result in \cite{10} also as a special case of corona product of graphs and hence different results for some particular thorn graphs were also derived there. Let us now consider one important type of graph which is the cluster product of \(G\) and \(P_2\). Using Theorem 2.6, its first reformulated Zagreb index is calculated as follows:

Corollary 2.10. Let \(G\) be a connected graph with \(n\) vertices and \(m\) edges, then \[EM_1(G\{P_2\})=EM_1(G)+5M_1(G)-4|E(G)|.\]

3. Application of Generalized Hierarchical Product and Cluster Product of Graphs

We know that, many chemically interesting molecular graphs and nanostructures are obtained from different graph operations of some particular graphs, so in this section we investigate such particular molecular graphs which are resultant of generalized hierarchical product and cluster product of some particular graphs. Thus, we apply the results derived in the previous section to compute reformulated first Zagreb index of some special chemically interesting molecular graphs and also of nanostructures. First we consider some chemical structure in the form \(P_2\sqcap H(U).\)

Example 3.1. The molecular graph of truncated cube can be considered as generalized hierarchical product of \(P_2\) and \(H(U)\) (shown in Figure 1) , where \(U=\{v_1,v_4,v_9,v_{12}\}\) . Since, \(EM_1(H)=2000\), thus using Corollary 2.4, we get \(EM_1(P_2\sqcap H(U))=576.\)

Example 3.2. The dimer fullerene is the generalized hierarchical product of \(P_2\) and \(C_{60}\), where \(U=\{5,6\}\) ( as shown in Figure 2). From direct calculation, we have \(EM_1(C_{60})=1440\). Thus, using Corollary 2.4, we get \(EM_1(P_2\sqcap C_{60}(U))=3064.\)

Example 3.3. Let \(L_n\) be the hexagonal chain with \(n\) hexagons (shown in Figure 3). From definition it is clear that \(L_n=P_2\sqcap P_{2n+1}(U)\), where \(U=\{v_1,v_3,v_5,…….,v_{2n+1}\}\). Then using Corollary 2.9, we get \[EM_1(L_n)=EM_1(P_2\sqcap P_{2n+1}(U))=52n-28.\]

Example 3.4. The zig-zag polyhex nanotube \(TUHC_6[2n,2]\) is the generalized hierarchical product of \(P_2\) and \(C_{2n}(U)\), where \(U=\{v_2,v_4,……..,v_{2n}\) (Figure 4). Thus using Corollary 2.4, we get \[EM_1(TUHC_6[2n,2])=EM_1(P_2\sqcap C_{2n}(U))=52n.\]

Example 3.5. The linear phenylene \(F_n\) with \(n\) benzene ring is the graph given by \(P_2\sqcap P_{3n}(U)\), where \(U=\{v_{3k+1}: 0\leq k \leq n-1\}\cup \{v_{3k}:1\leq k \leq n.\}\) Then using Corollary 2.4, we get the following result \[EM_1(F_n)=EM_1(P_2\sqcap P_{3n}(U))=96n-72.\]

In the following example, now we consider some important molecular structures which can be obtained as a result of cluster product of some special graphs. First let us consider one important nanostructure called regular dicentric dendrimers.

Example 3.6. Let \(DD_{p,r}\) denote the regular dicentric dendrimers. Then \(DD_{p,r}=P_2\{H\}\) , where \(H\) is a dendron tree of progressive degree \(p\) and generation \(r\) (see Figure 6). Thus using theorem 2.6, we get \[EM_1(DD_{p,r})=2EM_1(H)+12p^2-2p.\] Since from direct calculation, we have \[EM_1(H)=\frac{p(p^{r+2}+3p^{r+1}-8p^2+5p-1)}{p-1}.\] So, we get from above \[EM_1(DD_{p,r})=\frac{2p^2(p^{r+1}-3p^r-2p-2)}{p-1}.\]

Example 3.8. The sun graph denoted by \(Sun_{(m,n)}\) is defined as cluster product of \(C_m\) and \(P_{n+1}\), where \(P_{n+1}\) is rooted at a vertex of degree one. Then using Theorem 2.6, the reformulated first Zagreb index of \(Sun_{(m,n)}\) is given by \[EM_1(Sun_{(m,n)})=2m(2n+9).\]

Example 3.9. Let \(\Gamma\) be the molecular graph of octanitrocubane (see Figure 7). It can be considered as the cluster product of a cube \((G)\) and \(P_2\). Then using Corollary 2.4, we similarly get \(EM_1(\Gamma)=504.\)

Example 3.10. The square comb lattice graph \(C_q(N)\) with open ends, can be considered as the cluster product \(P_n\{P_n\},\) where \(N=n^2\) is the total number of vertices of \(C_q(N)\) (see Figure 8). Here root of \(P_n\) is on its pendent vertex i.e. the vertex of degree one. Thus applying Theorem 2.6 we get, for \(n\ge 3\) \[EM_1(C_q(N))=n(8n-14)+6(n-1)+6(2n-3)+6n-14=8n^2+10n-38.\]

4. Conclusion

In this paper, we first derive explicit expression of reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence using this result we obtain the reformulated first Zagreb index of cluster product of two graphs. Finally, the reformulated first Zagreb index of some molecular graphs such as square comb lattice, hexagonal chain, molecular graph of truncated cube, dimer fullerene etc. are obtained.

Acknowledgments

The authors thank the reviewers for their constructive comments in improving the quality of this paper.

Competing Interests

The author(s) do not have any competing interests in the manuscript.

References:

  1. Todeschini, R., & Consonni, V. (2008). Handbook of molecular descriptors (Vol. 11). John Wiley & Sons. [Google Scholor]
  2. Todeschini, R., & Consonni, V. (2009). Molecular descriptors for chemoinformatics: volume I: alphabetical listing/volume II: appendices, references (Vol. 41). John Wiley \& Sons. [Google Scholor]
  3. Gutman, I., & Trinajstić, N. (1972). Graph theory and molecular orbitals. Total \(\pi\)-electron energy of alternant hydrocarbons. Chemical Physics Letters, 17(4), 535-538. [Google Scholor]
  4. Miličević, A., Nikolić, S., & Trinajstić, N. (2004). On reformulated Zagreb indices. Molecular diversity, 8(4), 393-399. [Google Scholor]
  5. Zhou, B., & Trinajstić, N. (2010). Some properties of the reformulated Zagreb indices. Journal of mathematical chemistry, 48(3), 714-719. [Google Scholor]
  6. Ilić, A., & Zhou, B. (2012). On reformulated Zagreb indices. Discrete Applied Mathematics, 160(3), 204-209. [Google Scholor]
  7. Su, G., Xiong, L., Xu, L., & Ma, B. (2011). On the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most \(k\). Filomat, 25(4), 75-83. [Google Scholor]
  8. De, N. (2012). Some bounds of reformulated Zagreb indices. Appl. Math. Sci, 6(101), 5005-5012.[Google Scholor]
  9. De, N. (2013). Reformulated Zagreb indices of dendrimers. Math. Aeterna, 3(2), 133-138. [Google Scholor]
  10. Ji, S., Li, X., & Huo, B. (2014). On reformulated Zagreb indices with respect to acyclic, unicyclic and bicyclic graphs. MATCH Commun. Math. Comput. Chem, 72(3), 723-732. [Google Scholor]
  11. Ji, S., Li, X., & Qu, Y. (2014). On reformulated zagreb indices with respect to tricyclic graphs. arXiv preprint arXiv:1406.7169. [Google Scholor]
  12. De, N., Nayeem, S. M. A., & Pal, A. (2015). Reformulated first Zagreb index of some graph operations. Mathematics, 3(4), 945-960. [Google Scholor]
  13. De, N., Pal, A., & Nayeem, S. M. A. (2014). On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations. International Journal of Combinatorics, 2014, Article ID 579257, 5 pages. [Google Scholor]
  14. De, N., Nayeem, S. M. A., & Pal, A. (2016). F-index of some graph operations. Discrete Mathematics, Algorithms and Applications, 8(02), 1650025. [Google Scholor]
  15. De, N., Nayeem, S. M. A., & Pal, A. (2016). The F-coindex of some graph operations. SpringerPlus, 5(1), 221. [Google Scholor]
  16. Khalifeh, M. H., Yousefi-Azari, H., & Ashrafi, A. R. (2009). The first and second Zagreb indices of some graph operations. Discrete Applied Mathematics, 157(4), 804-811.[Google Scholor]
  17. Ashrafi, A. R., Došlić, T., & Hamzeh, A. (2010). The Zagreb coindices of graph operations. Discrete applied mathematics, 158(15), 1571-1578. [Google Scholor]
  18. Das, K. C., Yurttas, A., Togan, M., Cevik, A. S., & Cangul, I. N. (2013). The multiplicative Zagreb indices of graph operations. Journal of Inequalities and Applications, 2013(1), 90. [Google Scholor]
  19. Azari, M., & Iranmanesh, A. (2013). Computing the eccentric-distance sum for graph operations. Discrete Applied Mathematics, 161(18), 2827-2840. [Google Scholor]
  20. De, N. (2016). The vertex Zagreb indices of some graph operations. Carpathian Mathematical Publications, 8(2), 215-223.[Google Scholor]
  21. Azari, M. (2014). Sharp lower bounds on the Narumi–Katayama index of graph operations. Applied Mathematics and Computation, 239, 409-421. [Google Scholor]
  22. Khalifeh, M. H., Yousefi-Azari, H., & Ashrafi, A. R. (2008). The hyper-Wiener index of graph operations. Computers & Mathematics with Applications, 56(5), 1402-1407. [Google Scholor]
  23. Tavakoli, M., Rahbarnia, F., & Ashrafi, A. R. (2014). Some new results on irregularity of graphs. \emph{J. Appl. Math. Inform, 32}, 675-685. [Google Scholor]
  24. Veylaki, M., Nikmehr, M. J., & Tavallaee, H. A. (2016). The third and hyper-Zagreb coindices of some graph operations. Journal of Applied Mathematics and Computing, 50(1-2), 315-325. [Google Scholor]
  25. Barrière, L., Dalfó, C., Fiol, M. A., & Mitjana, M. (2009). The generalized hierarchical product of graphs. Discrete Mathematics, 309(12), 3871-3881. [Google Scholor]
  26. Barriere, L., Comellas, F., Dalfó, C., & Fiol, M. A. (2009). The hierarchical product of graphs. Discrete Applied Mathematics, 157(1), 36-48. [Google Scholor]
  27. Arezoomand, M., & Taeri, B. (2013). Zagreb indices of the generalized hierarchical product of graphs. MATCH Commun. Math. Comput. Chem, 69(1), 131-140. [Google Scholor]
  28. Eliasi, M., & Iranmanesh, A. (2013). Hosoya polynomial of hierarchical product of graphs. MATCH Commun. Math. Comput. Chem, 69(1), 111-119. [Google Scholor]
  29. Luo, Z., & Wu, J. (2014). Zagreb eccentricity indices of the generalized hierarchical product graphs and their applications. Journal of Applied Mathematics, 2014 Article ID 241712, 8 pages. [Google Scholor]
  30. De, N., Nayeem, S. M. A., & Pal, A. (2015). Total eccentricity index of the generalized hierarchical product of graphs. International Journal of Applied and Computational Mathematics, 1(3), 503-511. [Google Scholor]
  31. Arezoomand, M., & Taeri, B. (2010). Applications of generalized hierarchical product of graphs in computing the Szeged index of chemical graphs. MATCH Commun. Math. Comput. Chem, 64(3), 591-602. [Google Scholor]
  32. Gutman, I. (1998). Distance in thorny graph. Publ. Inst. Math., 63, 31-36.[Google Scholor]
  33. De, N. (2012). On eccentric connectivity index and polynomial of thorn graph. Applied Mathematics, 3(08), 931-934. [Google Scholor]
  34. De, N. (2012). Augmented eccentric connectivity index of some thorn graphs. International Journal of Applied Mathematical Research, 1(4), 671-680. [Google Scholor]
  35. De, N., Pal, A., & Nayeem, S. M. A. (2014). Modified eccentric connectivity of generalized thorn graphs. International Journal of Computational Mathematics, 2014, Article ID 436140, 8 pages. [Google Scholor]