8,090
Views
6
CrossRef citations to date
0
Altmetric
Research Articles

The (a,b)-Zagreb index of some derived networks

ORCID Icon, ORCID Icon, ORCID Icon &
Pages 79-86 | Received 24 May 2018, Accepted 05 Oct 2018, Published online: 24 Oct 2018

ABSTRACT

There is a very wide application of mathematics in communication theory, signal processing and networking. A network is formed by nodes communicating with each other. Graph theory plays a vital role in the area of networking research. A topological index is a numeric quantity obtained from a graph structure which is invariant under graph isomorphism. In this study, we obtained a generalized degree-based topological index, called (a,b)-Zagreb index of some derived networks such as Sierpinski network, butterfly network, Benes network and mesh-derived network and hence consider some particular cases.

1. Introduction

An interconnection network can be considered as a graph G=(V(G),E(G)), where V(G) denotes a set of nodes or vertex and E(G) is the set of interconnections between the nodes of G. The degree of a vertex vV(G) is defined as the number of adjacent vertices of v in G and is denoted as dG(v). A topological index is a function f:IR with the property that f(G)=f(H) for all G,H are isomorphic, where denotes the set of all finite simple graphs and IR is the set of all real numbers. In the last decade, a lot of studies on different topological indices for different graph families and network structures were conducted and successfully applied in mathematical chemistry. Recently, H. Alih et al. in [Citation1] studied on the topological properties of hierarchical interconnection networks. The Sierpinski network was developed from the studies of Lipscomb's space and was first introduced by S. Klavžar et al. in [Citation2]. The vertex set of S[m,n] is the Cartesian product of m sets {1,2,3,..,n}, while the edges are defined according to a certain relation. The vertex set of S[m,n] is defined as V(S[m,n])={1,2,3,.,n}m and |V(S[m,n])|=nm. Recently, M. Imran et al. studied topological properties of Sierpinski networks in [Citation3]. Butterfly network BF[n] is a well-known and important topological structure of interconnection networks. It is extensively used for parallel architectures and for achieving a technique to interpret Fast Fourier Transform (FFT), which is comprehensively used for signal processing. Butterfly network and some other closely multistage interconnection networks are used for several proposed designs for the switching fabric of sealable high-speed ATM networks. A Benes network is derived from the butterfly network by overlapping the low-order cycles of two butterfly networks. An n dimensional Benes network is denoted as B[n] with (2n+1)2n nodes. If Pr is a path of r vertices, then Pr×Pt is defined as the two-dimensional mesh network with r rows and t columns. This network was first introduced by I. Rajasingh et al. in [Citation4], and is denoted as Mr,t. The bounded medial of r×t mesh is obtained by applying medial operations on r×t mesh and then by deleting those vertices that are placed on unbounded faces. The mesh- derived network was first introduced by M. Imran et al. [Citation5] in 2014. This network was obtained by taking union of r×t mesh and its bounded medial in a way that the vertices of bounded medial are placed in the middle of each edge of r×t mesh, the resulting structure is called as a mesh-derived network of first type and is denoted as MDN1[r,t]. The vertex and edge cardinalities of MDN1[r,t] are 3rtrt and 8rt6(r+t)+4, respectively. The second type of mesh- derived network is obtained from the union of r×t mesh and its bounded dual r1×t1 mesh by joining every vertex of r1×t1 mesh to every vertex of the corresponding face of r×t mesh. The resulting structure is called second type mesh-derived network and is denoted as MDN2[r,t]. The vertex and edge cardinalities of MDN2[r,t] are 2rtrt+1 and 8(rtrt+1), respectively. The parameters r and t are defined as the number of vertices in any row and column, respectively. A new branch cheminformatics is a combination of mathematics, information sciences and chemistry. This branch studies QSAR/QSPR study, physicochemical properties and topological indices such as Zagreb indices, “forgotten topological index”, redefined Zagreb index, general first Zagreb index, general Randić index, symmetric division deg index, generalized Zagreb index and so on to predict physicochemical properties and biological activities of the chemical compounds theoretically. The most oldest and extremely studied vertex degree-based topological indices are Zagreb indices, which were introduced by Gutman and Trinajestić in 1972 [Citation6], to study the total π-electron energy(ϵ) of carbon atoms and are defined as M1(G)=vV(G)dG(v)2=uvE(G)[dG(u)+dG(v)] and M2(G)=uvE(G)dG(u)dG(v). We refer our reader to [Citation7–9], for further study about this index. The “forgotten topological index” or F-index of a graph was introduced in the same paper [Citation6], where Zagreb indices were introduced. This index is defined as F(G)=vV(G)dG(v)3=uvE(G)[dG(u)2+dG(v)2]. Some recent study about this index we refer our reader to [Citation10–13]. One of the redefined versions of the Zagreb index is defined as ReZM(G)=uvE(G)dG(u)dG(v)[dG(u)+dG(v)] and was first introduced by Ranjini et al. in 2013 [Citation14]. Li and Zheng in [Citation15] generalized the first Zagreb index and F-index as follows Mα(G)=uV(G)dG(u)α, where α0,1 and αIR. Clearly, when α=2, we obtain the first Zagreb index and when α=3 it gives the F-index. Gutman and Lepović generalized the Randić index in [Citation16] and is defined as Ra=uvE(G){dG(u).dG(v)}a, where a0,aIR. The symmetric division deg index of a graph is defined as SDD(G)=uvE(G)dG(u)dG(v)+dG(v)dG(u). We refer our reader to [Citation17, Citation18], for further study about this index. Based on Zagreb indices, Azari et al.[Citation19] introduced an another type of topological index called generalized Zagreb index or the (a,b)-Zagreb index in 2011 and is defined as Za,b(G)=uvE(G)(dG(u)adG(v)b+dG(u)bdG(v)a). For further study about this index, we refer our reader to [Citation20, Citation21]. It is clear that all the topological indices discussed previously in this paper are derived from this (a,b)-Zagreb index for some particular values of a and b. Table  shows the relation between (a,b)-Zagreb index to some other topological indices for some particular values of a and b. In this work, we study the mathematical property of (a,b)-Zagreb index for some derived networks such as Sierpinski network S[m,n], butterfly network BF[n], Benes network B[n] and mesh-derived network MDN1[r,t].

Table 1. Relations between (a,b)-Zagreb index with some other topological indices

2. Main results

In this section, we derived (a,b)-Zagreb index of some well-defined networks. First, we consider S[m,n]. The edge sets of S[m,n] are divided as follows: E1(S[m,n])={e=uvE(S[m,n]):dS[m,n](u)=n1anddS[m,n](v)=n},E2(S[m,n])={e=uvE(S[m,n]):dS[m,n](u)=nanddS[m,n](v)=n}, note that, |E1(S[m,n])|=2n,|E2(S[m,n])|=nm+15n2. The Sierpinski network S[4,4] is depicted in Figure .

Figure 1. Sierpinski network S[3,4].

Figure 1. Sierpinski network S[3,4].

Theorem 2.1

The (a,b)-Zagreb index of Sierpinski network (S[m,n]) is given by (1) Za,b(S[m,n])=2.nb+1(n1)a+2na+1(n1)b+nm+a+b+15na+b+1.(1)

Proof.

Applying the definition of (a,b)-Zagreb index, we obtain Za,b(S[m,n])=uvE(S[m,n])(dS[m,n](u)adS[m,n](v)b+dS[m,n](u)bdS[m,n](v)a)=uvE1(S[m,n])[(n1)anb+(n1)bna]+uvE2(S[m,n])(nanb+nbna)=|E1(S[m,n])|[(n1)anb+(n1)bna]+|E2(S[m,n])|2.na+b=2n[(n1)anb+(n1)bna]+nm+15n2.2.na+b. Hence, the theorem.

Corollary 2.2

From Equation (Equation1), we derived the following results. (i) M1(S[m,n])=Z1,0(S[m,n])=n(nm+1n2),(ii) M2(S[m,n])=12Z1,1(S[m,n])=12n(nm+2n24n),(iii) F(S[m,n])=Z2,0(S[m,n])=n(nm+2n22n+2),(iv) ReZM(S[m,n])=Z2,1(S[m,n])=n(nm+2n24n+2),(v) Ma(S[m,n])=Za1,0(S[m,n])=2n(n1)a1+nm+a3na,(vi) Ra(S[m,n])=12Za,a(S[m,n])=4na+1(n1)a+nm+2a+15n2a+1,(vii) SDD(S[m,n])=Z1,1(S[m,n])=2n2(n1)1+nm+13n2.

Now, we consider the butterfly network BF[n] and obtained the (a,b)-Zagreb index of this network. The figure of two-dimensional butterfly network BF[2] is shown in Figure . The edge set of this network is partitioned as follows: E1(BF[n])={e=uvE(BF[n]):dBF[n](u)=2anddBF[n](v)=4},E2(BF[n])={e=uvE(BF[n]):dBF[n](u)=4anddBF[n](v)=4}, such that, |E1(BF[n])|=2n+2,|E2(BF[n])|=2n+1(n2).

Figure 2. An example of two-dimensional butterfly network BF[2].

Figure 2. An example of two-dimensional butterfly network BF[2].

Theorem 2.3

The (a,b)-Zagreb index of BF[n] is given by (2) Za,b(BF[n])=2n+2(2a+2b+22a+b)+2n+1(n2).22(a+b)+1.(2)

Proof.

Using the definition of (a,b)-Zagreb index, we obtain Za,b(BF[n])=uvE(NF[n])(dBF[n](u)adBF[n](v)b+dBF[n](u)bdBF[n](v)a)=uvE1(BF[n])(2a4b+2b4a)+uvE2(BF[n])(4a4b+4b4a)=|E1(BF[n])|(2a22b+2b22a)+|E2(BF[n])|2.4a+b=2n+2(2a+2b+22a+b)+2n+1(n2).2.22(a+b), which is the required theorem.

Corollary 2.4

We derived the following results by using Equation (Equation2), (i) M1(BF[n])=Z1,0(BF[n])=2n+3(2n1),(ii) M2(BF[n])=12Z1,1(BF[n])=2n+5(n1),(iii) F(BF[n])=Z2,0(BF[n])=2n+4(4n3),(iv) ReZM(BF[n])=Z2,1(BF[n])=2n+5(8n11),(v) Ma(BF[n])=Za1,0(BF[n])=2n+2(2(a1)+22(a1))+2n+2a(n2),(vi) Ra(BF[n])=12Za,a(BF[n])=2n+2.23a+2n+1(n2).24a,(vii) SDD(BF[n]) =Z1,1(BF[n])=2n+1(2n1).

Here, we consider the Benes network B[n] and derived the (a,b)-Zagreb index of this network. An example of two-dimensional Benes network B[2] is shown in Figure . The edge sets of B[n] are shown as follows: E1(B[n])={e=uvE(B[n]):dB[n](u)=2anddB[n](v)=4},E2(B[n])={e=uvE(B[n]):dB[n](u)=4anddB[n](v)=4}, such that, |E1(B[n])|=2n+2,|E2(B[n])|=2n+2(n1).

Figure 3. An example of two-dimensional Benes network B[2].

Figure 3. An example of two-dimensional Benes network B[2].

Theorem 2.5

The (a,b)-Zagreb index of B[n] is given by (3) Za,b(B[n])=2n+2(2a+2b+22a+b)+2n+2(n1).22(a+b)+1.(3)

Proof.

From the definition of (a,b)-Zagreb index, we obtain Za,b(B[n])=uvE(B[n])(dB[n](u)adB[n](v)b+dB[n](u)bdB[n](v)a)=uvE1(B[n])(2a4b+2b4a)+uvE2(B[n])(4a4b+4b4a)=|E1(B[n])|(2a22b+2b22a)+|E2(B[n])|2.4a+b=2n+2(2a+2b+22a+b)+2n+2(n1).2.22(a+b). Hence the theorem.

Corollary 2.6

From Equation (Equation3), we derived the following results. (i) M1(B[n])=Z1,0(B[n])=2n+3(4n1),(ii) M2(B[n])=12Z1,1(B[n])=2n+5(4n3),(iii) F(B[n])=Z2,0(B[n])=2n+2(32n12),(iv) ReZM(B[n])=Z2,1(B[n])=2n+4(32n29),(v) Ma(B[n])=Za1,0(B[n])=2n+2(2(a1)+22(a1))+2n+2a+1.(n1),(vi) Ra(B[n])=12Za,a(B[n])=2n+2{23a+(n1).24a},(vii) SDD(B[n])=Z1,1(B[n])=2n+1(4n+1).

Now, we obtained (a,b)-Zagreb index of mesh-derived network MDN1[r,t]. The edge sets of MDN1[r,t] are shown as follows: E1(MDN1[r,t])={e=uvE(MDN1[r,t]):dMDN1[r,t](u)=2anddMDN1[r,t](v)=4},E2(MDN1[r,t])={e=uvE(MDN1[r,t]):dMDN1[r,t](u)=3anddMDN1[r,t](v)=4},E3(MDN1[r,t])={e=uvE(MDN1[r,t]):dMDN1[r,t](u)=3anddMDN1[r,t](v)=6},E4(MDN1[r,t])={e=uvE(MDN1[r,t]):dMDN1[r,t](u)=4anddMDN1[r,t](v)=6},E5(MDN1[r,t])={e=uvE(MDN1[r,t]):dMDN1[r,t](u)=4anddMDN1[r,t](v)=4},E6(MDN1[r,t])={e=uvE(MDN1[r,t]):dMDN1[r,t](u)=6anddMDN1[r,t](v)=6}, note that, |E1(MDN1[r,t])|=8,|E2(MDN1[r,t])|=4(r+t4),|E3(MDN1[r,t])|=2(r+t4),|E4(MDN1[r,t])|=4(rtrt),|E5(MDN1[r,t])|=4,|E6(MDN1[r,t])|=4(rt2r2t+4). So that, |V(MDN1[r,t])|=(3rtrt) and |E(MDN1[r,t])|={8rt6(r+t)+4}.

An example MDN1[4,4] is shown in Figure .

Figure 4. An example of MDN1[4,4] network.

Figure 4. An example of MDN1[4,4] network.

Theorem 2.7

For MDN1[r,t], the (a,b)-Zagreb index is given by (4) Za,b(MDN1[r,t])=8(2a+2b+22a+b)+4(r+t4)(3a.4b+3b.4a)+2(r+t4).3a+b.(2a+2b)+4.22(a+b)+1+4(rtrt)(22a+b.3b+2a+2b.3a)+8(rt2r2t+4)6a+b.(4)

Proof.

Using the definition of (a,b)-Zagreb index, we obtain Za,b(MDN1[r,t])=uvE(MDN1[r,t])(d(u)ad(v)b+d(u)bd(v)a)=uvE1(MDN1[r,t])(2a4b+2b4a)+uvE2(MDN1[r,t])(3a4b+3b4a)+uvE3(MDN1[r,t])(3a6b+3b6a)+uvE4(MDN1[r,t])(4a6b+4b6a)+uvE5(MDN1[r,t])(4a4b+4b4a)+uvE6(MDN1[r,t])(6a6b+6b6a)=|E1(MDN1[r,t])|(2a22b+2b22a)+|E2(MDN1[r,t])|(3a4b+3b4a)+|E3(MDN1[r,t])|×(3a.3b.2b+3b.3a.2a)+|E4(MDN1[r,t])|×(22a.2b.3b+22b.2a.3a)+|E5(MDN1[r,t])|.2.22(a+b)+|E6(MDN1[r,t])|.2.6a+b=8(2a+2b+22a+b)+4(r+t4)(3a4b+3b4a)+2(r+t4).3a+b.(2b+2a)+4(rtrt)(22a+b.3b+2a+2b.3a)+4.22(a+b)+1+8(rt2r2t+4).6a+b, which is the desired result.

Corollary 2.8

Using Equation (Equation4), we derived the following results, (i) M1(MDN1[r,t])=Z1,0(MDN1[r,t])=46(r+t4)+40(rtrt)+48(rt2r2t+4)+80,(ii) M2(MDN1[r,t])=12Z1,1(MDN1[r,t])=84(r+t4)+96(rtrt)+144(rt2r2t+4)+128,(iii) F(MDN1[r,t])=Z2,0(MDN1[r,t])=190(r+t4)+160(rtrt)+288(rt2r2t+4)+288,(iv) ReZM(MDN1[r,t])=Z2,1(MDN1[r,t])=660(r+t4)+960(rtrt)+1728(rt2r2t+4)+896,(v) Ma(MDN1[r,t])=Za1,0(MDN1[r,t])=8(2a1+22(a1))+4(r+t4)(3a1+4a1)+2(r+t4)3a1(2a1+1)+4.22(a1)+1+4(rtrt)×(22(a1)+2a1.3a1)+8(rt2r2t+4).6a1,(vi) Ra(MDN1[r,t])=12Za,a(MDN1[r,t])=8.23a+4(r+t4).3a.4a+2(r+t4).32a.2a+22(2a+1)+4(rtrt).23a.3a+4(rt2r2t+4).62a,(vii) SDD(MDN1[r,t])=Z1,1(MDN1[r,t])=403(r+t4)+263(rtrt)+8(rt2r2t+4)+28.

Finally, we consider a type 2 mesh-derived network MDN2[r,t] and obtain the (a,b)-Zagreb index of this network. An example of the type 2 mesh-derived network MDN2[4,4] is shown in Figure . The edge set of this network partitioned as follows: E1(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=3anddMDN2[r,t](v)=6},E2(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=3anddMDN2[r,t](v)=5},E3(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=5anddMDN2[r,t](v)=6},E4(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=5anddMDN2[r,t](v)=5},E5(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=6anddMDN2[r,t](v)=8},E6(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=5anddMDN2[r,t](v)=8},E7(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=5anddMDN2[r,t](v)=7},E8(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=7anddMDN2[r,t](v)=7},E9(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=6anddMDN2[r,t](v)=7},E10(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=7anddMDN2[r,t](v)=8},E11(MDN2[r,t])={e=uvE(MDN2[r,t]):dMDN2[r,t](u)=8anddMDN2[r,t](v)=8}, note that, |E1(MDN2[r,t])|=4,|E2(MDN2[r,t])|=8,|E3(MDN2[r,t])|=8,|E4(MDN2[r,t])|=2(r+t6),|E5(MDN2[r,t])|=4,|E6(MDN2[r,t])|=2(r+t4),|E7(MDN2[r,t])|=4(r+t6),|E8(MDN2[r,t])|=2(r+t8),|E9(MDN2[r,t])|=8,|E10(MDN2[r,t])|=6(r+t6),|E11(MDN2[r,t])|=8rt24(r+t)+72.

Figure 5. An example of MDN2[4,4] network.

Figure 5. An example of MDN2[4,4] network.

Theorem 2.9

The (a,b)-Zagreb index of MDN2[r,t], is given by (5) Za,b(MDN2[r,t])=4(3a.6b+3b.6a)+8(3a.5b+3b.5a)+8(5a.6b+5b.6a)+4(r+t6).5a+b+4(6a.8b+6b.8a)+2(r+t4).(5a.8b+5b.8a)+4(r+t6)(5a.7b+5b.7a)+4(r+t8).7a+b+8(7a.6b+7b.6a)+6(r+t6)(7a.8b+7b.8a)+2{8rt24(r+t)+72}.8a+b.(5)

Proof.

From the definition of (a,b)-Zagreb index, we obtain Za,b(MDN2[r,t])=uvE(MDN2[r,t])(d(u)ad(v)b+d(u)bd(v)a)=uvE1(MDN2[r,t])(3a6b+3b6a)+uvE2(MDN2[r,t])(3a5b+3b5a)+uvE3(MDN2[r,t])(5a6b+5b6a)+uvE4(MDN2[r,t])(5a5b+5b5a)+uvE5(MDN2[r,t])(6a8b+6b8a)+uvE6(MDN2[r,t])(5a8b+5b8a)+uvE7(MDN2[r,t])(5a7b+5b7a)+uvE8(MDN2[r,t])(7a7b+7b7a)+uvE9(MDN2[r,t])(6a7b+6b7a)+uvE10(MDN2[r,t])(7a8b+7b8a)+uvE11(MDN2[r,t])(8a8b+8b8a)=|E1(MDN2[r,t])|(3a6b+3b6a)+|E2(MDN2[r,t])|(3a5b+3b5a)+|E3(MDN2[r,t])|(5a6b+5b6a)+|E4(MDN2[r,t])|(5a5b+5b5a)+|E5(MDN2[r,t])|(6a8b+6b8a)+|E6(MDN2[r,t])|(5a8b+5b8a)+|E7(MDN2[r,t])|(5a7b+5b7a)+|E8(MDN2[r,t])|(7a7b+7b7a)+|E9(MDN2[r,t])|(6a7b+6b7a)+|E10(MDN2[r,t])|(7a8b+7b8a)+|E11(MDN2[r,t])|(8a8b+8b8a)=4(3a6b+3b6a)+8(3a5b+3b5a)+8(5a6b+5b6a)+4(r+t6).5a+b+4(6a8b+6b8a)+2(r+t4)(5a8b+5b8a)+4(r+t6)(5a7b+5b7a)+4(r+t8).7a+b+8(6a7b+6b7a)+6(r+t6)(7a8b+7b8a)+2{8rt24(r+t)+72}.8a+b. Hence, the desired result.

Corollary 2.10

From Equation (Equation5), we obtain the following results. (i) M1(MDN2[r,t])=Z1,0(MDN2[r,t])=158(r+t6)+26(r+t4)+28(r+t8)+16{8rt24(r+t)+72}+348,(ii) M2(MDN2[r,t])=12Z1,1(MDN2[r,t])=526(r+t6)+80(r+t4)+98(r+t8)+64{8rt24(r+t)+72}+960,(iii) F(MDN2[r,t])=Z2,0(MDN2[r,t])=1074(r+t6)+178(r+t4)+196(r+t8)+128{8rt24(r+t)+72}+2020,(iv) ReZM(MDN2[r,t])=Z2,1(MDN2[r,t])=7220(r+t6)+1040(r+t4)+1372(r+t8)+1024{8rt24(r+t)+72}+11304,(v) Ma(MDN2[r,t])=Za1,0(MDN2[r,t])=4(3a1+6a1)+8(3a1+5a1)+8(5a1+6a1)+4(r+t6).5a1+4(6a1+8a1)+2(r+t4)(5a1+8a1)+4(r+t6)(5a1+7a1)+4(r+t8).7a1+8(7a1+6a1)+6(r+t6)(7a1+8a1)+2{8rt24(r+t)+72}.8a1,(vi) Ra(MDN2[r,t])=12Za,a(MDN2[r,t])=4.3a.6a+8.3a.5a+8.5a.6a+2(r+t6).52a+4.6a.8a+2(r+t4).5a.8a+4(r+t6).5a.7a+2(r+t8).72a+8.7a.6a+6(r+t6).7a.8a+{8rt24(r+t)+72}.82a,(vii) SDD(MDN2[r,t])=Z1,1(MDN2[r,t])=3439140(r+t6)+8920(r+t4)+4(r+t8)+2{8rt24(r+t)+72}+7237105.

3. Conclusions

In this work, we study the (a,b)-Zagreb index of some derived networks and hence obtain some other topological indices such as Zagreb indices, “forgotten topological index”, redefined Zagreb index, general first Zagreb index, general Randić index, and symmetric division deg index for some particular values of a and b. For further study, some other network structures can be considered for studying this (a,b)-Zagreb index.

Disclosure statement

No potential conflict of interest was reported by the authors.

Correction Statement

This article has been republished with minor changes. These changes do not impact the academic content of the article.

Additional information

Funding

This work was supported by CSIR, HRDG, New Delhi, India [09/973(0016)/2017-EMR-I].

References

  • Ali H, Baig AQ. On topological properties of hierarchical interconnection networks. J Appl Math Comput. 2017;55:313–334. doi: 10.1007/s12190-016-1038-3
  • Klavžar S, Milutinović U. Graphs S(n,k) and a variant of the tower of Hanoi problem. Czechoslovak Math J. 1997;47:95–104. doi: 10.1023/A:1022444205860
  • Imran M, Hafi SE, Gao W, et al. On topological properties of Sierpinski network. Chaos, Solitons, Fractals. 2017;98:199–204. doi: 10.1016/j.chaos.2017.03.036
  • Rajasingh I, Shanthi AS, Muthumalai A. Excessive index for mesh derived networks. J Discrete Algorithms. 2015;33:43–48. doi: 10.1016/j.jda.2014.07.001
  • Imran M, Hayat S, Mailk MYH. On topological indices of certain interconnection networks. Appl Math Comput. 2014;244:936–951.
  • Gutman I, Trinajestić N. Graph theory and molecular orbitals total π-electron energy of alternant hydrocarbons. Chem Phys Lett. 1972;17:535–538. doi: 10.1016/0009-2614(72)85099-1
  • Sarkar P, De N, Pal A. The Zagreb indices of graphs based on new operations related to the join of graphs. J Int Math Virtual Inst. 2017;7:181–209.
  • De N. The vertex Zagreb indices of some graphs operations. Carpathian Math Publ. 2016;8(2):215–223. doi: 10.15330/cmp.8.2.215-223
  • Khalifeh MH, Yousefi-Azari H, Ashrafi AR. The first and second Zagreb indices of some graph operations. Discrete Appl Math. 2009;157(4):804–811. doi: 10.1016/j.dam.2008.06.015
  • Sarkar P, De N, Pal A. F-index of graphs based on new operations related to the join of graphs, arXiv:1709.06301v1
  • De N, Nayeem SMA, Pal A. F-index of some graph operations. Discrete Math Algorithm Appl. 2016;8(2):1–17. doi: 10.1142/S1793830916500257
  • De N, Nayeem SMA. Computing the F-index of nanostar dendrimers. Pac Sci A: Nat Sci Eng. 2016;18:14–21.
  • De N. F-index and coindex of some derived graphs. J Int Math Virtual Inst. 2018;8:81–88.
  • Ranjini PS, Lokesha V, Usha A. Relation between phenylene and hexagonal squeeze using harmonic index. Int J Graph Theory. 2013;1:116–121.
  • Li X, Zheng J. A unified approach to the extremal trees for different indices. MATCH Commun Math Comput Chem. 2005;54:195–208.
  • Gutman I, Lepović M. Choosing the exponent in the definition of the connectivity index. J Serb Chem Soc. 2001;66(9):605–611. doi: 10.2298/JSC0109605G
  • Alexander V. Upper and lower bounds of symmetric division deg index. Iran J Math Chem.. 2014;52:91–98.
  • Gupta CK, Lokesha V, Shwetha BS, et al. Graph operations on the symmetric division deg index of graphs. Palestine J Math. 2017;6(1):280–286.
  • Azari M, Iranmanesh A. Generalized Zagreb index of graphs. Studia Univ Babes-Bolyai. 2011;56(3):59–70.
  • Farahani MR, Kanna MRR. Generalized Zagreb index of V-phenylenic nanotubes and nanotori. J Chem Pharm Res. 2015;7(11):241–245.
  • Farahani MR. The generalized Zagreb index of circumcoronene series of benzenoid. J Appl Phys Sci Int. 2015;3(3):99–105.