 Research
 Open access
 Published:
The Fcoindex of some graph operations
SpringerPlus volume 5, Article number: 221 (2016)
Abstract
The Findex of a graph is defined as the sum of cubes of the vertex degrees of the graph. In this paper, we introduce a new invariant which is named as Fcoindex. Here, we study basic mathematical properties and the behavior of the newly introduced Fcoindex under several graph operations such as union, join, Cartesian product, composition, tensor product, strong product, corona product, disjunction, symmetric difference of graphs and hence apply our results to find the Fcoindex of different chemically interesting molecular graphs and nanostructures.
Background
Topological indices are found to be very useful in chemistry, biochemistry and nanotechnology in isomer discrimination, structure–property relationship, structureactivity relationship and pharmaceutical drug design. Let G be a simple connected graph with vertex set V(G) and edge set E(G) respectively. Let, for any vertex \({v}\in V(G)\), \({{d}_{G}}(v)\) denotes its degree, that is the number of adjacent vertices of v in G. The complement of a graph G is denoted by \(\bar{G}\) and is the simple graph with the same vertex set V(G) and any two vertices \(uv\in E({\bar{G}})\) if and only if \(uv\notin E(G)\). Thus \(E(G)\cup E({\bar{G}})=E(K_n)\) and \(E(\bar{G})=\frac{V(G)(V(G)1)}{2}E(G)\). Also the degree of a vertex v in \(\bar{G}\) is given by \({{d}_{\bar{G}}}(v)=V(G)1{{d}_{G}}(v).\)
The first and second Zagreb indices of a graph are among the most studied vertexdegree based topological indices. These indices were introduced by Gutman and Trinajstić (1972) to study the structuredependency of the total \(\pi\)electron energy (\(\varepsilon\)) and are denoted by \(M_1(G)\) and \(M_2(G)\) respectively. They are defined as
and
Another vertexdegree based topological index was defined in the same paper where the Zagreb indices were introduced, and that was shown to influence \(\varepsilon\). This index was not further studied until it was studied by Furtula and Gutman (2015) in a recent article. They named this index as “forgotten topological index” or “Findex”. Findex of a graph G is denoted by F(G) and is defined as the sum of cubes of the vertex degrees of the graph.
It can be easily shown that the above definition is equivalent to
Very recently the present authors have studied the Findex of different graph operations in De et al. (2016).
Doslic (2008) introduced Zagreb coindices while computing weighted Wiener polynomial of certain composite graphs. In this case the sum runs over the edges of the complement of G. Thus the Zagreb coindices of G are defined as
and
Like Zagreb coindices, corresponding to Findex, we introduce here a new invariant, the Fcoindex which is defined as follows.
Like Zagreb coindices, Fcoindex of G is not the Findex of \(\bar{G}\). Here the sum runs over \(E(\bar{G})\), but the degrees are with respect to G.
Motivation
According to the International Academy of Mathematical Chemistry, to identify whether any topological index is useful for prediction of chemical properties, the coorelation between the values of that topological index for different octane isomers and parameter values related to certain physicochemical property of them should be considered. Generally octane isomers are convenient for such studies, because the number of the structural isomers of octane is large (18) enough to make the statistical conclusion reliable. Furtula and Gutman (2015) showed that for octane isomers both \(M_1\) and F yield correlation coefficient greater than 0.95 in case of entropy and acentric factor. They also improved the predictive ability of these index by considering a simple linear model in the form \(({M_1}+{\lambda }F)\), where \(\lambda\) varies from −20 to 20.
In this paper, we find the correlation between the logarithm of the octanolwater partition coefficient (P) and the corresponding Fcoindex values of octane isomers. The dataset of octane isomers (first three columns of Table 1) are taken from www.moleculardescriptors.eu/dataset/dataset.htm and the last two columns of Table 1 are computed from the definitions of F(G) and \(\bar{F}(G)\). Fcoindex values against \(\log P\) values are plotted in Fig. 1. Here we find that the correlation coefficient between \(\log P\) and \(\bar{F}\) is 0.966, whereas the correlation coefficient between \(\log P\) and \(M_1\) and that between \(\log P\) and F are 0.077 and 0.065 respectively. Thus using this Fcoindex, we can predict the \(\log P\) values with high accuracy.
Graph operations play an important role in chemical graph theory. Different chemically important graphs can be obtained by applying graph operations on some general or particular graphs. For example, the linear polynomial chain (or the ladder graph \(L_n\)) is the molecular graph related to the polynomial structure obtained by the Cartesian product of \(P_2\) and \(P_{n+1}\). The \(C_4\) nanotube \(TUC_4(m, n)\) is the Cartesian product of \(P_n\) and \(P_m\) and the \(C_4\) nanotorus \(TC_4(m, n)\) is the Cartesian product of \(C_n\) and \(C_m\). For a given graph G, one of the hydrogen suppressed molecular graph is the bottleneck graph, which is the corona product of \(K_2\) and G. There are several studies on various topological indices under different graph operations available in the literature. Khalifeh et al. (2009) derived some exact formulae for computing first and second Zagreb indices under some graph operations. Das et al. (2013), derived some upper bounds for multiplicative Zagreb indices for different graph operations. Veylaki et al. (2015), computed third and hyperZagreb coindices of some graph operations. In De et al. (2014), the present authors computed some bounds and exact formulae of the connective eccentric index under different graph operations. Azari and Iranmanesh (2013) presented explicit formulas for computing the eccentricdistance sum of different graph operations. Interested readers are referred to Ashrafi et al. (2010), Khalifeh et al. (2008), Tavakoli et al. (2014), De et al. (2015a, b, c, d, Eskender and Vumar (2013) for other studies in this regard.
In this paper, we first derive some basic properties of Fcoindex and hence present some exact expressions for the Fcoindex of different graph operations such as union, join, Cartesian product, composition, tensor product, strong product, corona product, disjunction, symmetric difference of graphs. Also we apply our results to compute the Fcoindex for some important classes of molecular graphs and nanostructures.
Basic properties of Fcoindex
From definition, the Fcoindex for some special graphs such as complete graph, empty graph, path, cycle and complete bipartite graph on n vertices can be easily obtained as follows.

(i)
\(\bar{F}\left( {{K}_{n}}\right) =\bar{F}\left( {{\bar{K}}_{n}}\right) =0\),

(ii)
\(\bar{F}\left( {{C}_{n}}\right) =4n(n3)\),

(iii)
\(\bar{F}\left( {{P}_{n}}\right) =4{{n}^{2}}18n+20\),

(iv)
\(\bar{F}({{K}_{m,n}})=mn(2mnmn).\)
Let for the graph G we use the notation \(V(G)=n\) and \({{E}(G)}=m\). Also let \({{E}(\bar{G})}=\bar{m}\). Now first we explore some basic properties of Fcoindex.
Proposition 1
Let G be a simple graph with n vertices and m edges, then
Proof
From definition of Findex, we have
\(\square\)
Proposition 2
Let G be a simple graph with n vertices and m edges, then
Proof
From definition of Fcoindex, we have
\(\square\)
An alternative expression for \(\bar{F}(G)\) can be obtained by considering sum over the edges of G and \(\bar{G}\) respectively as follows.
Proposition 3
Let G be a simple graph with n vertices and m edges, then
Proof
From definition of Findex and Fcoindex, it follows that
from where the desired result follows. \(\square\)
Proposition 4
Let G be a simple graph with n vertices and m edges, then
Proof
From definition of Fcoindex, we have
\(\square\)
Main results
In the following, we study Fcoindex of various graph operations like union, join, Cartesian product, composition, tensor product, strong product, corona product, disjunction, symmetric difference of graphs. These operations are binary and if not indicated otherwise, we use the notation \(V(G_i)\) for the vertex set, \({{E}(G_i)}\) for the edge set, \({{n}_{i}}\) for the number of vertices and \({{m}_{i}}\) for the number of edges of the graph \({{G}_{i}}\) respectively. Also let \({\bar{{m}}_{i}}\) denote the number of edges of the graph \({{\bar{G}}_{i}}.\)
Union
The union of two graphs \({{G}_{1}}\) and \({{G}_{2}}\) is the graph denoted by \({{G}_{1}}\cup {{G}_{2}}\) with the vertex set \(V({{G}_{1}})\cup V({{G}_{2}})\) and edge set \(E({{G}_{1}})\cup E({{G}_{2}})\). In this case we assume that \(V({{G}_{1}})\) and \(V({{G}_{2}})\) are disjoint. The degree of a vertex v of \({{G}_{1}}\cup {{G}_{2}}\) is equal to that of the vertex in the component \({{G}_{i}}\,(i=1,2)\) which contains it. In the following preposition we calculate the Fcoindex of \({{G}_{1}}\cup {{G}_{2}}.\)
Proposition 5
Let G be a simple graph with n vertices and m edges, then
Proof
From definition of Fcoindex, it is clear that, the Fcoindex of \({{G}_{1}}\cup {{G}_{2}}\) is equal to the sum of the Fcoindices of the components \({{G}_{i}}(i=1,2)\), in addition to the contributions of the missing edges between the components which form the edge set of the complete bipartite graph \({{K}_{{{n}_{1}},{{n}_{2}}}}\). The contribution of these missing edges is given by
from where the desired result follows. \(\square\)
Join
The join of two graphs \({{G}_{1}}\) and \({{G}_{2}}\) with disjoint vertex sets \(V({{G}_{1}})\) and \(V({{G}_{2}})\) is the graph denoted by \({{G}_{1}}+{{G}_{2}}\) with the vertex set \(V({{G}_{1}})\cup V({{G}_{2}})\) and edge set \(E({{G}_{1}})\cup E({{G}_{2}})\cup \{uv:u\in V({{G}_{1}}),v\in V({{G}_{2}})\}\). Thus in the sum of two graphs, all the vertices of one graph is connected with all the vertices of the other graph, keeping all the edges of both graphs. Thus the degree of the vertices of \({{G}_{1}}+{{G}_{2}}\) is given by
In the following proposition the Fcoindex of \({{G}_{1}}+{{G}_{2}}\) is calculated.
Proposition 6
Let G be a simple graph with n vertices and m edges, then
Proof
From definition of \({{G}_{1}}+{{G}_{2}}\), it is clear that the contribution of the edges connecting the vertices of \({{G}_{1}}\) with those of \({{G}_{2}}\) is zero. So the Fcoindex of \({{G}_{1}}+{{G}_{2}}\) is given by
Now,
Similarly, we get
Combining \({{J}_{1}}\) and \({{J}_{2}}\) we get the desired result after simplification. \(\square\)
Example 1
The complete bipartite graph \({{K}_{p,q}}\) can be defined as \({{K}_{p,q}}={{\bar{K}}_{p}}+{{\bar{K}}_{q}}\). So its Fcoindex can be calculated from the previous proposition as \(\bar{F}({{K}_{p,q}})=pq(2pqpq).\)
The suspension of a graph G is defined as sum of G with a single vertex. So from the previous proposition the following corollary follows.
Corollary 1
The Fcoindex of suspension of G is given by
Example 2
The star graph \({{S}_{n}}\) with n vertices is the suspension of empty graph \({{\bar{K}}_{n1}}\). So its Fcoindex can be calculated from the previous corollary as \(\bar{F}({{S}_{n}})=(n1)(n2).\)
Example 3
The wheel graph \({{W}_{n}}\) on \((n+1)\) vertices is the suspension of \({{C}_{n}}\). So from the previous corollary its Fcoindex is given by \(\bar{F}({{W}_{n}})=9n(n3).\)
Example 4
The fan graph \({{F}_{n}}\) on \((n+1)\) vertices is the suspension of \({{P}_{n}}\). So from the previous corollary its Fcoindex is given by \(\bar{F}({{W}_{n}})=9{{n}^{2}}37n+38.\)
We now extend the join operation to more than two graphs. Let \(G_1,\) \(G_2,\ldots ,G_k\) be k graphs. Then, the degree of a vertex v in \({{G}_{1}}+{{G}_{2}}+\cdots +{{G}_{k}}\) is given by \({{d}_{{{G}_{1}}+{{G}_{2}}+\cdots +{G}_{k}}(v) ={{d}_{{{G}_{i}}}}(v)+{n}{{n}_{i}}}\), where v is originally a vertex of the graph \(G_i\) and \(n={{n}_{1}}+{{n}_{2}}+\cdots +{{n}_{k}}\). Also let \({\bar{n}_i}=n{n_i}\).
Proposition 7
The Fcoindex of \({{G}_{1}}+{{G}_{2}}+\cdots +{{G}_{k}}\) is given by
Proof
We have from definition of Fcoindex
which completes the proof. \(\square\)
Cartesian product
The Cartesian product of \(G_1\) and \(G_2\), denoted by \(G_1\times G_2\), is the graph with vertex set \(V(G_1)\times V(G_2)\) and any two vertices \(({{u}_{p}},{{v}_{r}})\) and \(({{u}_{q}},{{v}_{s}})\) are adjacent if and only if [\({{u}_{p}}={{u}_{q}}\in V(G_1)\) and \({{v}_{r}}{{v}_{s}}\in E(G_2)\)] or [\({{v}_{r}}={{v}_{s}}\in V(G_2)\) and \({{u}_{p}}{{u}_{q}}\in E(G_1)\)]. Thus we have, \({{d}_{{{G}_{1}}\times {{G}_{2}}}}(a,b)={{d}_{{{G}_{1}}}}(a)+{{d}_{{{G}_{2}}}}(b)\). In the following preposition we calculate the Fcoindex of \({{G}_{1}}\times {{G}_{2}}\).
Proposition 8
The Fcoindex of \({{G}_{1}}\times {{G}_{2}}\) is given by
Proof
Applying Theorem 1 of Khalifeh et al. (2009) and Theorem 3 of De et al. in Proposition 3 we get
from where the desired result follows after simplification. \(\square\)
Example 5
The Ladder graph \(L_n\) (linear polynomial chain) is the Cartesian product of \(P_2\) and \(P_{n+1}\). Thus from the last proposition the following result follows
Example 6
\(TUC_4(m, n)\) and \(TC_4(m,n)\) denote a \(C_4\) nanotube and nanotorus respectively. Then \(TUC_4(m, n)\cong {P_n}\times {C_m}\) and \(TC_4(m,n)\cong {C_n}\times {C_m},\) and so \(\bar{F}(TUC_4(m, n))=16{m^2}{n^2}14{m^2}n80mn+88m\) and \(\bar{F}(TC_4(m,n))=16{m}{n}(mn5)\).
Composition
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 \({{u}_{1}}{{v}_{1}}\in E({{G}_{1}})\) or [\({{u}_{1}}={{v}_{1}}\) and \({{u}_{2}}{{v}_{2}}\in E({{G}_{2}})\)]. The vertex set of \({{G}_{1}}[{{G}_{2}}]\) is \(V({{G}_{1}})\times V({{G}_{2}})\) and the degree of a vertex (a, b) of \({{G}_{1}}[{{G}_{2}}]\) is given by \({{d}_{{{G}_{1}}[{{G}_{2}}]}}(a,b)={{n}_{2}}{{d}_{{{G}_{1}}}}(a)+{{d}_{{{G}_{2}}}}(b).\) In the following proposition we compute the Fcoindex of the composition of two graphs.
Proposition 9
The Fcoindex of \({{G}_{1}}[{{G}_{2}}]\) is given by
The proof of the above proposition follows from the expressions of first Zagreb index and Findex of strong product graphs given in Theorems 3 and 4 of Khalifeh et al. (2009) and De et al. respectively.
Example 7
The fence graph is the composition of \({{P}_{n}}\) and \({{P}_{2}}\) and the Closed fence graph is the composition of \({{C}_{n}}\) and \({{P}_{2}}\). Thus, we have

(i)
\(\bar{F}({{P}_{n}}[{{P}_{2}}])=100{{n}^{2}}428n+456\),

(ii)
\(\bar{F}({{C}_{n}}[{{P}_{2}}])=100{{n}^{2}}300n.\)
Tensor product
The tensor product of two graphs \({{G}_{1}}\) and \({{G}_{2}}\) is denoted by \({{G}_{1}}\otimes {{G}_{2}}\) and any two vertices \(({{u}_{1}},{{v}_{1}})\) and \(({{u}_{2}},{{v}_{2}})\) are adjacent if and only if \({{u}_{1}}{{u}_{2}}\in E({{G}_{1}})\) and \({{v}_{1}}{{v}_{2}}\in E({{G}_{2}})\). The degree of a vertex (a, b) of \({{G}_{1}}\otimes {{G}_{2}}\) is given by \({{d}_{{{G}_{1}}\otimes {{G}_{2}}}}(a,b)={{d}_{{{G}_{1}}}}(a){{d}_{{{G}_{2}}}}(b)\). In the following proposition, the Fcoindex of the tensor product of two graphs is computed.
Proposition 10
The Fcoindex of \({{G}_{1}}\otimes {{G}_{2}}\) is given by
The proof follows from the expressions \({M_1}({{G}_{1}}\otimes {{G}_{2}})={{M}_{1}}({{G}_{1}}){{M}_{1}}({{G}_{2}})\) established in Theorem 2.1 of Yarahmadi (2011) and \(F({{G}_{1}}\otimes {{G}_{2}})=F({{G}_{1}})F({{G}_{2}})\) established in Theorem 7 of De et al.
Example 8

(i)
\(\bar{F}({{P}_{n}}\otimes {{P}_{m}})=4(mn1)(2n3)(2m3)4(4n7)(4m7)\)

(ii)
\(\bar{F}({{C}_{n}}\otimes {{C}_{m}})=16mn(mn5)\)

(iii)
\(\bar{F}({{K}_{n}}\otimes {{K}_{m}})=nm{{(n1)}^{2}}{{(m1)}^{2}}(m+n1)\)

(iv)
\(\bar{F}({{P}_{n}}\otimes {{C}_{m}})=4m(mn1)(2n3)(2m3)4(4n7)(4m7)\)

(v)
\(\bar{F}({{P}_{n}}\otimes {{k}_{m}})=m(mn1)(4n6){{(m1)}^{2}}m(8n14){(m1)^3}\)

(vi)
\(\bar{F}({{C}_{n}}\otimes {{K}_{m}})=4nm{{(m1)}^{2}}(mn2m+1)\).
Strong product graphs
The strong product of two graphs \(G_1\) and \(G_2\) is denoted by \({{G}_{1}}\boxtimes {{G}_{2}}\). It has the vertex set \(V(G_1)\times V(G_2)\) and any two vertices \(({{u}_{p}},{{v}_{r}})\) and \(({{u}_{q}},{{v}_{s}})\) are adjacent if and only if [\({{u}_{p}}={{u}_{q}}\in V(G_1)\) and \({{v}_{r}}{{v}_{s}}\in E(G_2)\)] or [\({{v}_{r}}={{v}_{s}}\in V(G_2)\) and \({{u}_{p}}{{u}_{q}}\in E(G_1)\)] or [\({{u}_{p}}{{u}_{q}}\in E(G_1)\) and \({{v}_{r}}{{v}_{s}}\in E(G_2)\)]. Note that if both \(G_1\) and \(G_2\) are connected then \({{G}_{1}}\boxtimes {{G}_{2}}\) is also connected. The degree of a vertex (a, b) of \({{G}_{1}}\boxtimes {{G}_{2}}\) is given by
In the following proposition we compute the Fcoindex of the strong product of two graphs.
Proposition 11
The Fcoindex of \({{G}_{1}}\boxtimes {{G}_{2}}\) is given by
The proof follows from the expressions of first Zagreb index and Findex of strong product graphs from Theorems 2.6 and 6 of Tavakoli et al. (2013) and De et al. respectively.
Corona product
The corona product \({{G}_{1}}\circ {{G}_{2}}\) of two graphs \(G_1\) and \(G_2\) is obtained by taking one copy of \({{G}_{1}}\) and \({{n}_{1}}\) copies of \({{G}_{2}}\) and by joining each vertex of the ith copy of \({{G}_{2}}\) to the ith vertex of \({{G}_{1}}\), where \(1\le i\le {{n}_{1}}\). The corona product of \({{G}_{1}}\) and \({{G}_{2}}\) has total \(({{n}_{1}}{{n}_{2}}+{{n}_{1}})\) number of vertices and \(({{m}_{1}}+{{n}_{1}}{{m}_{2}}+{{n}_{1}}{{n}_{2}})\) number of edges. Different topological indices under the corona product of graphs have already been studied (Yarahmadi and Ashrafi 2012; De et al. 2015e; Pattabiraman and Kandan 2014). It is easy to see that the degree of a vertex v of \({{G}_{1}}\circ {{G}_{2}}\) is given by
In the following proposition, the Fcoindex of the corona product of two graphs is computed.
Proposition 12
The Fcoindex of \({{G}_{1}}\circ {{G}_{2}}\) is given by
The proof of the above proposition follows from the relations
given in Theorem 2.8 of Yarahmadi and Ashrafi (2012) and
given in Theorem 7 of De et al.
Example 9
One of the hydrogen suppressed molecular graph is the bottleneck graph of a graph G, is the corona product of \({K}_{2}\) and G, where G is a given graph. Fcoindex of bottleneck graph of G is given by
where n is the number of vertices of G.
A tthorny graph is obtained by joining tnumber of thorns (pendent edges) to each vertex of a given graph G. A variety of topological indices of thorn graphs have been studied by a number of researchers (De 2012a, b; Alizadeh et al. 2014). It is well known that, the tthorny graph of G is defined as the corona product of G and complement of complete graph with t vertices \(\bar{K_t}\). Thus from the previous theorem the following corollary follows.
Corollary 2
The Fcoindex of tthorny graph of G is given by
Example 10
The Fcoindex of tthorny graph of \({{C}_{n}}\) and \({{P}_{n}}\) are given by

(i)
\(\bar{F}\left( {{C}_{n}}^{t}\right) ={{n}^{2}}{{t}^{3}}n{{t}^{3}}+6{{n}^{2}}{{t}^{2}}7n{{t}^{2}}+9{{n}^{2}}t18nt+4{{n}^{2}}12n\)

(ii)
\(\bar{F}\left( {{P}_{n}}^{t}\right) ={{n}^{2}}{{t}^{3}}n{{t}^{3}}+6{{n}^{2}}{{t}^{2}}11n{{t}^{2}}+9{{n}^{2}}t28nt+4{{n}^{2}}+6{{t}^{2}}18n+22t+20\).
Disjunction
The disjunction of two graphs \({{G}_{1}}\) and \({{G}_{2}}\), denoted by \({{G}_{1}}\wedge {{G}_{2}}\), consists of the vertex set \(V(G_1)\times V(G_2)\) and two vertices \((u_1,v_1)\) and \((u_2,v_2)\) are adjacent whenever \({u_1}{u_2}\in {E(G_1)}\) or \({v_1}{v_2}\in {E(G_2)}\). Clearly, the degree of a vertex \((u_1,u_2)\) of \({{G}_{1}}\wedge {{G}_{2}}\) is given by
In the following theorem we obtain the Fcoindex of the disjunction of two graphs.
Proposition 13
The Fcoindex of \({{G}_{1}}\wedge {{G}_{2}}\) is given by
The proof of the above proposition follows from Proposition 3 with the relevant results from Khalifeh et al. (2009) and De et al.
Symmetric difference
The symmetric difference of two graphs \({{G}_{1}}\) and \({{G}_{2}}\) is denoted by \({{G}_{1}}\oplus {{G}_{2}}\), so that \(V({{G}_{1}}\oplus {{G}_{2}})=V({{G}_{1}})\times V({{G}_{2}})\) and
From definition of symmetric difference it is clear that
In the following proposition we obtain the Fcoindex of the symmetric difference of two graphs.
Proposition 14
The Fcoindex of \({{G}_{1}}\oplus {{G}_{2}}\) is given by
Conclusion
In this paper, we have studied the Fcoindex of different graph operations and also apply our results to find Fcoindex 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. So, for further research, Fcoindex of various other graph operations and composite graphs can be considered.
References
Alizadeh Y, Iranmanesh A, Doslic T, Azari M (2014) The edge Wiener index of suspensions, bottlenecks, and thorny graphs. Glas Mat Ser III(49):1–12
Ashrafi AR, Doslic T, Hamzeh A (2010) The Zagreb coindices of graph operations. Discret Appl Math 158:1571–1578
Azari M, Iranmanesh A (2013) Computing the eccentricdistance sum for graph operations. Discret Appl Math 161(18):2827–2840
Das KC, Yurttas A, Togan M, Cevik AS, Cangul IN (2013)The multiplicative Zagreb indices of graph operations. J Inequal Appl. doi:10.1186/1029242X201390
De N (2012a) On eccentric connectivity index and polynomial of thorn graph. Appl Math 3:931–934
De N (2012b) Augmented eccentric connectivity index of some thorn graphs. Int J Appl Math Res 1(4):671–680
De N, Pal A, Nayeem SMA (2014) On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations. Int J Comb. doi:10.1155/2014/579257
De N, Pal A, Nayeem SMA (2015a) Modified eccentric connectivity of generalized thorn graphs. Int J Comput Math. doi:10.1155/2014/436140
De N, Pal A, Nayeem SMA (2015b) The irregularity of some composite graphs. Int J Appl Comput Math. doi:10.1007/s408190150069z
De N, Nayeem SMA, Pal A (2015c) Reformulated First Zagreb Index of Some Graph Operations. Mathematics 3(4):945–960. doi:10.3390/math3040945
De N, Nayeem SMA, Pal A (2015d) Total eccentricity index of the generalized hierarchical product of graphs. Int J Appl Comput Math. doi:10.1007/s4081901400164
De N, Nayeem SMA, Pal A (2015e) Modified eccentric connectivity index of corona product of graphs. Int J Comput Appl 132(9):1–5. doi:10.5120/ijca2015907536
De N, Nayeem SMA, Pal A (2016) Findex of some graph operations. Discrete Math Algorithm Appl. doi:10.1142/S1793830916500257
Doslic T (2008) Vertexweighted Wiener polynomials for composite graphs. Ars Math Contemp 1:66–80
Eskender B, Vumar E (2013) Eccentric connectivity index and eccentric distance sum of some graph operations. Trans Comb 2(1):103–111
Furtula B, Gutman I (2015) A forgotten topological index. J Math Chem 53(4):1184–1190
Gutman I, Trinajstić N (1972) Graph theory and molecular orbitals total \(\pi\)electron energy of alternant hydrocarbons. Chem Phys Lett 17:535–538
Khalifeh MH, YousefiAzari H, Ashrafi AR (2008) The hyperWiener index of graph operations. Comput Math Appl 56:1402–1407
Khalifeh MH, YousefiAzari H, Ashrafi AR (2009) The first and second Zagreb indices of some graph operations. Discret Appl Math 157(4):804–811
Pattabiraman K, Kandan P (2014) Weighted PI index of corona product of graphs. Discret Math Algorithms Appl. doi:10.1142/S1793830914500554
Tavakoli M, Rahbarnia F, Ashrafi AR (2013) Note on strong product of graphs. Kragujev J Math 37(1):187–193
Tavakoli M, Rahbarnia F, Ashrafi AR (2014) Some new results on irregularity of graphs. J Appl Math Inform 32:675–685
Veylaki M, Nikmehr MJ, Tavallaee HA (2015) The third and hyperZagreb coindices of some graph operations. J Appl Math Comput. doi:10.1007/s121900150872z
Yarahmadi Z (2011) Computing some topological indices of tensor product of graphs. Iran J Math Chem 2(1):109–118
Yarahmadi Z, Ashrafi AR (2012) The Szeged, vertex PI, first and second Zagreb indices of corona product of graphs. Filomat 26(3):467–472
Authors’ contributions
All of the authors have significant contributions to this paper and the final form of this paper is approved by all of them. All authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
De, N., Nayeem, S.M.A. & Pal, A. The Fcoindex of some graph operations. SpringerPlus 5, 221 (2016). https://doi.org/10.1186/s4006401618647
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s4006401618647