See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/327230978

F-INDEX OF TOTAL TRANSFORMATION GRAPHS

Article · August 2018

CITATIONS READS

4 2,461

1 author:

Nilanjan De
Tehatta Sadananda Mahavidyalaya
110 PUBLICATIONS 1,691 CITATIONS

SEE PROFILE

All content following this page was uploaded by Nilanjan De on 26 August 2018.

The user has requested enhancement of the downloaded file.

1 Contemp. Stud. Discrete Math., Vol. 2, No. 2, 2018, pp. 1-10

C ONTEMPORARY S TUDIES IN D ISCRETE M ATHEMATICS

e-ISSN: 2581-3676 http://www.csdm.org.in

F- INDEX OF TOTAL T RANSFORMATION G RAPHS

N ILANJAN D E
Department of Basic Sciences and Humanities (Mathematics),
Calcutta Institute of Engineering and Management, Kolkata, India.

Received: 21 November 2017, Accepted: 7 March 2018

Published Online: 27 July 2018.

Abstract: The F-index of a graph G is the sum of the cubes of the degrees of the vertices of G. In this paper, explicit
expressions for the F-index of different transformation graphs of type Gxyz with x, y, z ∈ {−, +} are obtained. F-index for
semitotal point graph and semitotal line graph are also obtained here.

Keywords: Topological Indices, Graph Operations, Total Transformation Graph

Mathematics Subject Classification 2010: 05C07, 05C76, 05Cxz.

Copyright: The Authors. This article is published under the Creative Commons Attribution 4.0 International (CC BY
4.0) License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is
propositionerly cited.

1 Introduction

Chemical graph theory is a branch of mathematical chemistry where molecular structures are modeled as molecular
graphs. A molecular graph is a simple unweighted, undirected graph where the vertices correspond to atoms and edges
correspond to the bonds between them. A topological index is a numeric quantity which depends on the topology of
a molecular graph. More precisely, it is a real number Top(G) derived from the graph G such that for every graph
H isomorphic to G, Top(G) = Top(H). Topological indices correlates the physico-chemical properties of molecular
graphs and are used for studying quantitative structure-activity (QSAR) and structure-property (QSPR) relationships
for predicting different properties of chemical compounds and biological activities. In chemistry, biochemistry and
nanotechnology, different topological indices are found to be useful in isomer discrimination, QSAR, QSPR and
pharmaceutical drug design.
Suppose G be a simple connected graph and V (G) and E(G) respectively denote the vertex set and edge set of G.
Let, n and m respectively denote the number of vertices and edges of G. Let, for any vertex v ∈ V (G), dG (v) denotes
its degree, that is the number of neighbors of v and N(v) denotes the set of vertices which are the neighbors of the
vertex v, so that |N(v)| = dG (v).
Among various types of topological indices, degree based topological indices are most widely used indices and
those have great applications in chemical graph theory. Two of the oldest and well known topological indices are the
first and second Zagreb indices, which were first introduced by Gutman et al. in 1972 [2], where they have examined
the dependence of the total π-electron energy on molecular structure.

∗ Corresponding author: [email protected] c 2018 The Authors.

Contemp. Stud. Discrete Math. Vol.2, No.2, 2018, pp. 1-10. 2

The first and second Zagreb indices of a graph G are denoted by M1 (G) and M2 (G) and are respectively defined
as

M1 (G) = ∑ dG (v)2 = ∑ [dG (u) + dG (v)]

v∈V (G) uv∈E(G)

and
M2 (G) = ∑ dG (u)dG (v).
uv∈E(G)

These indices are extensively studied in chemical and mathematical literature. Interested readers are referred to [1,
7,8, 9, 10, 11] for some recent results on the topic. In the same paper, where Zagreb indices were introduced, another
topological index, was also shown to influence total π-electron energy. This index was defined as sum of cubes of
degrees of the vertices of the graph. However, this index never got attention except recently Furtula et al. [3] studied
this index and establish some basic properties of this index and showed that the predictive ability of this index is
almost similar to that of first Zagreb index and for the entropy and acetic factor, both of them yield correlation
coefficients greater than 0.95. They named this index as “forgotten topological index” or “F-index”. Throughout this
paper, we call this index as F-index and denote it by F(G). So,

F(G) = ∑ dG (v)3 = ∑ [dG (u)2 + dG (v)2 ]. (1)

v∈V (G) uv∈E(G)

Recently, the present author have studied this index for different graph operations [4]. They have also introduced its
coindex version in [27]. In [5], Abdo et al. have investigated the extremal trees with respect to the F-index.

2 Preliminaries, Definitions and Notations

Transformation graphs converts the information from the original graph into new transformed structure. Thus if is
it possible to find out the given graph from the transformed graph, then such operation may be used to figure out
structural properties of the original graph considering the transformation graphs (for details see [22]). In different
mathematical literature, several graph transformation have been considered where the vertex set of the transformed
graph is equal to V (G) ∪ E(G). The best known type of such graphs is the total graph. The total graph T (G) of
a graph G is the graph whose vertex set is V (G) ∪ E(G) and any two vertices of T (G) are adjacent if and only if
they are either incident or adjacent in G [6, 28, 30, 29]. Two other kinds of transformation graphs were introduced by
Sampathkumar in [17, 18, 19] and were named as semitotal-point graph and semitotal-line graph. The semitotal-point
graph of a graph G is denoted by T1 (G) and any two vertices u, v ∈ V (T1 (G)) are adjacent in T1 (G) if and only if
either both u and v are adjacent vertices in G or one is a vertex of G and the other is an edge of G incident to
the former. So T1 (G) has total (m + n) vertices and 3m number of edges. The semitotal-line graph of a graph G is
denoted by T2 (G) and any two vertices u, v ∈ V (T2 (G)) are adjacent in T2 (G) if and only if either both u and v are
adjacent edges in G or one is a vertex of G and other is an edge of G which is incident to it. So T1 (G) has total
(m + n) vertices and ( 21 M1 (G) + m) number of edges.
Let x, y, z be three variables taking values either + or −. Wu and Meng [22] generalized the concept of total graphs
to a total transformation graph Gxyz with x, y, z ∈ {−, +}. In this paper we consider this type of total transformation
graphs and hence we consider 3-permutation of the set +, −. The transformation graphs of G has the vertex set
V (G) ∪ E(G) so that |V (Gxyz )| = (n + m) and for any two vertices u, v of the transformation graph, the associatively
is + if they are adjacent or incident in G and the associatively is − if they are neither adjacent nor incident in G.
Hence, for any two vertices u, v ∈ V (Gxyz ), u and v are adjacent in Gxyz , if and only if

c 2018 The Authors.

3 Nilanjan De : F-index of Total Transformation Graphs

(i) u, v ∈ V (G), u, v are adjacent in G if x = + and u, v are not adjacent in G if x = −.

(ii) u, v ∈ E(G), u, v are adjacent in G if y = + and u, v are not adjacent in G if y = −.
(iii) u ∈ V (G) and v ∈ E(G), u, v are incident in G if z = + and u, v are not incident in G if z = −.
Since, there are eight distinct 3-permutation of +, −, so we can construct eight different transformation of a given
graph G of type Gxyz where xyzε{+ + +, − − −, + + −, − − +, + − −, − + +, + − +, − + −}. From construction, it is
clear that the graphs G+++ is isomorphic to the total graph T (G). Also, for a given graph G, G+++ and G−−− , G++−
and G−−+ , G−++ and G+−− , G+−+ and G−+− are the pairs of complementary graphs. The study of basic properties
of these transformation graphs were studied in [20, 21, 22, 23] where as different results of various topological indices
of these transformations can be seen in [15, 16]. The different transformation graphs of cycle graph C4 with vertex
set {1, 2, 3, 4} and edge set {a, b, c, d} are depicted in figure 1 to 4.
The topological indices, defined as the sum of contributions of all pairs of vertices, can be expressed in terms of
contributions of edges as follows ([13, 14])
 
F1 (u) F1 (v)
∑ F1 (u) = ∑ +
u∈V (G) uv∈E(G)
d(u) d(v)

Thus if F1 (u) = dG (u)4 , then we define

∑ dG (v)4 = ∑ [dG (u)3 + dG (v)3 ] = ξ4 (G). (2)

v∈V (G) uv∈E(G)

One of the redefined versions of Zagreb index is defined as

ReZG3 (G) = ∑ dG (u)dG (v)[dG (u) + dG (v)]. (3)

uv∈E(G)

For different recent study of these index see [12, 25, 26, 24]. In this paper we use this index to express the transformation
graphs of a graph G. The following proposition was derived in [27] and will be needed in the present study.

Proposition 1. Let G be a graph of order n and size m, then

F(Ḡ) = 2(n − 1)2 (m̄ − 2m) + 3(n − 1)M1 (G) − F(G).

Different composite and transformation graphs 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 this paper
we derive explicit expressions for the F-index of different total transformation graphs including semitotal point graph
and semitotal line graph.

3 Main Results

We first determine the F-index of the semitotal-point graph T1 (G) and semitotal-line graph T2 (G).

Theorem 1. Let G be a graph of order n and size m. Then

(i) F(T1 (G)) = 8F(G) + 8m.
(ii) F(T2 (G)) = F(G) + ξ4 (G) + 3ReZG3 (G).

Proof. (i) Since, dT1 (G) (u) = 2dG (u), if u ∈ V (T1 (G)) ∩ V (G)and dT1 (G) (u) = 2, if u ∈ V (T1 (G)) ∩ E(G), we have
from (1)

c 2018 The Authors.

Contemp. Stud. Discrete Math. Vol.2, No.2, 2018, pp. 1-10. 4

Fig. 1: C4 +++ and C4 −−− .

F(T1 (G)) = ∑ [2dG (u)]3 + ∑ 23 = 8F(G) + 8m.

u∈V (G) uv∈E(G)

(ii) From definition, since dT2 (G) (u) = 2dG (u), if u ∈ V (T2 (G)) ∩V (G) and dT2 (G) (u) = 2, if u ∈ V (T2 (G)) ∩ E(G),
we get from (1)

F(T2 (G)) = ∑+− dG++ (u)3

u∈V (G )

= ∑ dG++ (u)3 + ∑ dG++ (u)3

u∈V (G++ )∩V (G) u∈V (G++ )∩E(G)

= ∑ dG (u)3 + ∑ [dG (u) + dG (v)]3

u∈V (G) uv∈E(G)

= F(G) + ∑ [dG (u)3 + dG (v)3 ] + 3 ∑ [dG (u) + dG (v)]dG (u)dG (v)

uv∈E(G) uv∈E(G)
= F(G) + ξ4 (G) + 3ReZG3 (G).

Hence the result. t

u
Now, we consider F-index of the total transformation graphs of type Gxyz , where x = y = z = +.

Theorem 2. Let G be a graph of order n and size m. Then

F(G+++ ) = 8F(G) + ξ4 (G) + 3ReZG3 (G).

Proof. From the construction of G+++ we have, for u ∈ V (G+++ ) ∩ V (G), dG+++ (u) = 2dG (u) and for
u ∈ V (G+++ ) ∩ E(G), dG+++ (u) = dG (u) + dG (v).

F(G+++ ) = ∑+++ dG+++ (v)3

v∈V (G )

= ∑ dG+++ (v)3 + ∑ dG+++ (v)3

u∈V (G +++ )∩V (G) u∈V (G +++ )∩E(G)
3
= ∑ 8dG (u) + ∑ [dG (u) + dG (v)]3
v∈V (G) uv∈E(G)

c 2018 The Authors.

5 Nilanjan De : F-index of Total Transformation Graphs

= 8F(G) + ∑ [dG (u)3 + dG (v)3 ] + 3 ∑ dG (u)dG (v)[dG (u) + dG (v)]

uv∈E(G) uv∈E(G)

from where the desired result follows. t

u
Next, we calculate F-index of the complement of total transformation graphs of above type, that is of Gxyz , where
x = y = z = −.
Theorem 3. Let G be a graph of order n and size m. Then

F(G−−− ) = (3m + 3n − 11)F(G) − 3(m + n − 1)(m + n − 5)M1 (G) + 6(m + n − 1)M2 (G)
−ξ4 (G) − 3ReZG3 (G) + (m + n)(m + n − 1)3 − 12m(m + n − 1)2 .

∼ G+++ , where the notation ∼

Proof. Since, G−−− = = indicates the two graphs are isomorphic, the desired result
follows from the Proposition 1 by applying Theorem 3 and the following results.

1
|E(G+++ )| = [4m + M1 (G)]
2

M1 (G+++ ) = 4M1 (G) + 2M2 (G) + F(G)

This result can also derived from direct calculation as for u ∈ V (G−−− ) ∩V (G), dG−−− (u) = m + n − 1 − 2dG (u) and
for u ∈ V (G−−− ) ∩ E(G), dG−−− (u) = m + n − 1 − (dG (u) + dG (v)). tu
In the following, we consider F-index of the total transformation graphs of type Gxyz , where x = y = + and z = −.
Theorem 4. Let G be a graph of order n and size m. Then

F(G++− ) = 3(n − 4)F(G) + 3(n − 4)2 M1 (G) + 6(n − 4)M2 (G) + ξ4 (G)
+3ReZG3 (G) + nm3 + m(n − 4)3 .

Proof. We have, for u ∈ V (G++− )∩V (G), dG++− (u) = m and for u ∈ V (G++− )∩E(G), dG++− (u) = dG (u)+dG (v)+
n − 4. Thus from (1) we have

F(G++− ) = ∑++− dG++− (v)3

v∈V (G )

= ∑ dG++− (v)3 + ∑ dG++− (v)3

u∈V (G++− )∩V (G) u∈V (G++− )∩E(G)

= ∑ m3 + ∑ [dG (u) + dG (v) + (n − 4)]3

v∈V (G) uv∈E(G)

= nm + 3
∑ [dG (u) + dG (v)]3 + 3(n − 4)3 ∑ [dG (u) + dG (v)]
uv∈E(G) uv∈E(G)

+3(n − 4) ∑ [dG (u) + dG (v)]2 + ∑ (n − 4)3

uv∈E(G) uv∈E(G)

= nm3 + m(n − 4)3 + ξ4 (G) + 3ReZG3 (G) + 3(n − 4)2 M1 (G) + 3(n − 4)[F(G) + 2M2 (G)].

from where the desired result follows. tu

Now, similarly we calculate F-index of the complement of total transformation graphs of previous type, that is of
xyz
G , where x = y = − and z = +.

c 2018 The Authors.

Contemp. Stud. Discrete Math. Vol.2, No.2, 2018, pp. 1-10. 6

Fig. 2: C4 ++− and C4 −−+ .

Theorem 5. Let G be a graph of order n and size m. Then

F(G−−+ ) = 3(m + 3)F(G) − 3(m + 3)2 M1 (G) + 6(m + 3)M2 (G) − ξ4 (G) − 3ReZG3 (G)
+n(n − 1)3 + m(m + 3)3 .

Proof. Again since, G−−+ = G++− , the desired result follows from the Proposition 1 by applying Theorem 5 and
the following results.
1
|E(G++− )| = [2m(n − 2) + M1 (G)]
2
M1 (G++− ) = mn(m + n − 8) + 16m + 2(n − 4)M1 (G) + 2M2 (G) + F(G)

It can be easily seen that, this result can also derived from directly as for u ∈ V (G−−+ ) ∩V (G), dG−−+ (u) = n − 1 and
for u ∈ V (G−−+ ) ∩ E(G), dG−−+ (u) = (m + 3) − (dG (u) + dG (v)). t u
Next, we consider F-index of the total transformation graphs of type Gxyz , where x = − and y = z = +.

Theorem 6. Let G be a graph of order n and size m. Then

F(G−++ ) = n(n − 1)3 + ξ4 (G) + 3ReZG3 (G).

Proof. From definition we have, for u ∈ V (G−++ ) ∩ V (G), dG−++ (u) = (n − 1) and for u ∈ V (G−++ ) ∩ E(G),
dG−++ (u) = dG (u) + dG (v).

F(G−++ ) = ∑−++ dG−++ (v)3

v∈V (G )

= ∑ dG−++ (v)3 + ∑ dG−++ (v)3

u∈V (G −++ )∩V (G) u∈V (G −++ )∩E(G)
3
= ∑ (n − 1) + ∑ [dG (u) + dG (v)]3
v∈V (G) uv∈E(G)
3
= n(n − 1) + ∑ [dG (u)3 + dG (v)3 ] + 3 ∑ dG (u)dG (v)[dG (u) + dG (v)]
uv∈E(G) uv∈E(G)

from where the desired result follows. t

u

c 2018 The Authors.

7 Nilanjan De : F-index of Total Transformation Graphs

Fig. 3: C4 −++ and C4 +−− .

Similarly, in the following we calculate F-index of the complement of total transformation graphs of previous type,
that is of Gxyz , where x = + and y = z = −.

Theorem 7. Let G be a graph of order n and size m. Then

F(G+−− ) = 3(m + n − 1)F(G) − ξ4 (G) − 3ReZG3 (G) − 3(m + n − 1)2 M1 (G)

+6(m + n − 1)M2 (G) + m(m + n − 1)3 + nm3 .

Proof. Again since, G+−− = G−++ , the desired result follows from the Proposition 1 by applying Theorem 7 and
the following results.
1
|E(G−++ )| = [n(n − 1) + M1 (G)]
2
M1 (G−++ ) = n(n − 1)2 + 2M2 (G) + F(G)

This result can also derived from direct calculation as for u ∈ V (G+−− ) ∩V (G), dG+−− (u) = m and for u ∈ V (G+−− ) ∩
E(G), dG+−− (u) = (m + n − 1) − (dG (u) + dG (v)). t u
Next, we consider F-index of the total transformation graphs of type Gxyz , where x = z = + and y = −.

Theorem 8. Let G be a graph of order n and size m. Then

F(G+−+ ) = (3m + 17)F(G) − 3(m + 3)2 M1 (G) + 6(m + 3)M2 (G) − ξ4 (G)
−3eReZG3 (G) + m(m + 3)3 .

Proof. From definition we have, for u ∈ V (G+−+ ) ∩ V (G), dG+−+ (u) = 2dG (v) and for u ∈ V (G+−+ ) ∩ E(G)
dG+−+ (u) = m + 3 − (dG (u) + dG (v)).

F(G+−+ ) = ∑+−+ dG+−+ (v)3

v∈V (G )

= ∑ dG+−+ (v)3 + ∑ dG+−+ (v)3

u∈V (G +−+ )∩V (G) +−+
u∈V (G )∩E(G)

c 2018 The Authors.

Contemp. Stud. Discrete Math. Vol.2, No.2, 2018, pp. 1-10. 8

Fig. 4: C4 +−+ and C4 −+− .

= ∑ 8dG (v)3 + ∑ [(m + 3) − (dG (u) + dG (v))]3

v∈V (G) uv∈E(G)

= 8F(G) + m(m + 3)3 − 3(m + 3)2 ∑ [dG (u) + dG (v)]

uv∈E(G)
2 3
+3(m + 3) ∑ [dG (u) + dG (v)] − ∑ [dG (u) + dG (v)]
uv∈E(G) uv∈E(G)
3 2
= 8F(G) + m(m + 3) − 3(m + 3) M1 (G) + 3(m + 3)[F(G) + 2M2 (G)]
−ξ4 (G) − 3ReZG3 (G)

from where the desired result follows. t

u
Similarly, in the following we calculate F-index of the complement of total transformation graphs of previous type,
that is of Gxyz , where x = z = − and y = +.

Theorem 9. Let G be a graph of order n and size m. Then

F(G−+− ) = (3n − 20)F(G) + (3n2 − 12n + 12m + 36)M1 (G) + 6(n − 4)M2 (G) + ξ4 (G)
+3ReZG3 (G) + (m + n − 1)2 {n(m + n − 1) − 12m} + m(n − 4)3 .

Proof. Again since, G−+− = G+−+ , the desired result follows from the Proposition 1 by applying Theorem 9 and
the following results.

1
|E(G+−+ )| = [m(m + 7) − M1 (G)]
2

M1 (G+−+ ) = m(m + 3)2 − 2(m + 1)M1 (G) + 2M2 (G) + F(G)

This result can also derived from direct calculation as for u ∈ V (G−+− ) ∩ V (G), dG−+− (u) = m + n − 1 − 2dG (u)
and for u ∈ V (G−+− ) ∩ E(G), dG−+− (u) = (n − 4) + (dG (u) + dG (v)). t
u

c 2018 The Authors.

9 Nilanjan De : F-index of Total Transformation Graphs

4 Conclusion

In this paper, we determine the F-index of transformation graphs in terms of different graph invariants and showed
that how it changes under different transformations. The results obtained in this study illustrate the prospects of
application of F-index for chemical, biological, pharmaceutical sciences.For further studies different other topological
indices of some new derived graphs can be obtained to understand the underlying topology.

References

[1] Khalifeha, M.H.; Yousefi-Azaria, H.; Ashrafi, A.R. The first and second Zagreb indices of some graph operations. Disc.
Appl. Math. bf 2009, em 157(4), 804-811.
[2] Gutman, I.; Trinajstić, N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem.
Phys. Lett. 1972, 17, 535-538.
[3] Furtula, B.; Gutman, I. A forgotten topological index. J. Math. Chem. 2015, 53(4), 1184-1190.
[4] De, N.; Nayeem, S.M.A.; Pal, A. F-index of some graph operations. Discrete Math. Algorithm. Appl. 2016, doi
:10.1142/S1793830916500257.
[5] Abdoa, H.; Dimitrov D.; Gutman, I. On extremal trees with respect to the F-index. arXiv:1509.03574 2015.
[6] Yan, W.; Yang, B.Y.; Yeh, Y.N. The behavior of Wiener indices and polynomials of graphs under fivegraph decorations.
Appl. Math. Lett. 2007, 20, 290-295.
[7] Fath-Tabar, G.H. Old and new Zagreb indices of graphs. MATCH Commun. Math. Comput. Chem. 2011, 65, 79-84.
[8] Zhou, B. Upper bounds for the Zagreb indices and the spectral radius of series-parallel graphs. Int. J. Quantum Chem.
2007, 107, 875-878.
[9] Zhou, B.; Gutman, I. Further properties of Zagreb indices, MATCH Commun. Math. Comput. Chem., 2005 em 54 ,
233-239.
[10] Xu, K.; Tang, K.; Liu, H.; Wang, J. The Zagreb indices of bipartite graphs with more edges. J. Appl. Math. & Informatics
2015, 33, 365-377.
[11] Das, K.C.; Xu, K.; Nam, J. On Zagreb indices of graphs, Front. Math. China 2015, 10, 567-582.
[12] Ranjini, P.S.; Lokesha, V.; Usha, A. Relation between phenylene and hexagonal squeeze using harmonic index. Int. J. of
Graph Theory 2013, 1, 116-121.
[13] Gutman I. Edge-decomposition of topological indices. Iranian Journal of Mathematical Chemistry 2015 6(2), 103-108.
[14] Doslić, T.; Reti, T.; Vukicevic, D. On the vertex degree indices of connected graphs. Chem. Phys. Lett. 2011 512,
283-286.
[15] Hosamani, S.M.; Gutman, I. Zagreb indices of transformation graphs and total transformation graphs. Appl. Math.
Comput. 2014, 247, 1156-1160.
[16] Basavanagoud, B.; Gutman, I.; Desai, V.R. Zagreb indices of generalized transformation graphs and their complement.
Kragujevac J. Sci. 2015, 37, 99-112.
[17] Sampathkumar, E.; Chikkodimath, S.B. Semitotal graphs of a graph - I. J. Karnatak Univ. Sci. 1973, 18, 274-280.
[18] Sampathkumar, E.; Chikkodimath, S.B. Semitotal graphs of a graph - II. J. Karnatak Univ. Sci. 1973, 18, 281-284.
[19] Sampathkumar, E.; Chikkodimath, S.B. Semitotal graphs of a graph - III. J. Karnatak Univ. Sci. 1973, 18, 285-296.
[20] Xu, L.; Wu, B. Transformation graph G−+− . Discrete Math. 2008, 308, 5144-5148.
[21] L. Yi., B. Wu, The transformation graph G++− , Aust. J. Comb. 2009, 44, 37-42.
[22] Wu, B.; Meng, J. Basic properties of total transformation graphs. J. Math. Study 2001, 34, 109-116.
[23] Zhang, Z.; Huang, X. Connectivity of transformation graph G+−+ . Graph Theory Notes of New York 2002, XLIII, 35-38.
[24] Xu, X. Relationships between harmonic index and other topological indices. Appl. Math. Sc. 2012, 6(41), 2013-2018.
[25] Ranjini, P.S.; Usha, A.; Lokesha, V.; Deepika, T. Harmonic index, redefined Zagreb indices of dragon graph with complete
graph. Asian J. Math. Comp. Res. 2016, 9(2), 161-166.

c 2018 The Authors.

Contemp. Stud. Discrete Math. Vol.2, No.2, 2018, pp. 1-10. 10

[26] W. Gao, W. Wang and M.R. Farahani, Topological Indices Study of Molecular Structure in Anticancer Drugs, J. Chem.,
2016, http://dx.doi.org/10.1155/2016/3216327.
[27] De, N.; Nayeem, S.M.A.; Pal, A. The F-coindex of some graph operations. SpringerPlus 2016, 5:221, doi: 10.1186/s40064-
016-1864-7.
[28] De, N.; Nayeem, S.M.A.; Pal, A. Total eccentricity index of the generalized hierarchical product of graphs. Int. J. Appl.
Comput. Math. 2014, doi:10.1007/s40819-014-0016-4.
[29] De, N.; Pal, A.; Nayeem, S.M.A. The irregularity of some composite graphs. Int. J. Appl. Comput. Math. 2015,
doi:10.1007/s40819-015-0069-z.
[30] De, N.; Pal, A.; Nayeem, S.M.A. Total eccentricity index of some composite graphs. Malaya J. Mat. 2015, 3(4), 523-529.

c 2018 The Authors.

View publication stats