![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph. These parameters have applications in chemistry and drug structures. In this paper, we study the F index of strong product of two connected graphs in which one of the graphs is obtained by using four new sums called F sums of graphs and the other is any connected graph.
1 Introduction
Throughout this paper we consider only simple connected graphs, that is, connected graphs without loops and multiple edges. For a graph with vertex set
and edge set
, the degree of a vertex
in
is the number of edges incident to
and is denoted by
.
A graphical invariant is a number related to a graph which is structurally invariant. In chemical graph theory, these invariant numbers are also known as the topological indices. The first and second Zagreb indices of a graph are among the most studied vertex degree based topological indices. These indices were introduced by Gutman and Trinajestić [Citation1], to study the structure dependency of the total -electron energy on molecular structure, and this was elaborated on in [Citation2]. Another vertex degree based topological index was defined in [Citation1] where the Zagreb indices were introduced, and this index was not further studied until it was studied by Furtula and Gutman in the article [Citation3]. A few basic properties of the forgotten topological index and the significant enhancement of physico-chemical applicability of the first Zagreb index are shown in [Citation3].
Also forgotten topological index of several widely chemical structures which often appear in drug molecular graphs were presented in [Citation4]. The lower and upper bounds of forgotten topological index in terms of graph irregularity, Zagreb indices, graph size and maximum/minimum vertex degrees were given in [Citation5].
For a (molecular) graph , the first Zagreb index
and the second Zagreb index
are, respectively, defined as follows:
Also,
. For more details on these indices see the recent papers [Citation6–13] and the references therein. The zeroth-order general Randić index is a more general case of the first Zagreb index [14,15] and see survey paper on Randić index [Citation16].
In [Citation17], exact expressions for the first and second Zagreb indices of graph operations containing the Cartesian product, composition, join, disjunction, and symmetric difference of graphs were presented. Also, exact expressions for the first and second Zagreb indices of graphs based on operations related to the Cartesian product and the lexicographic product were given in [Citation18] and [Citation19], respectively. The closed formulas for the F-index of four operations of graphs to Cartesian product were determined in [Citation20].
In this work, we will study the F index of four new operations related to the strong product on graphs. For this purpose, we recall some operations on graphs in the following (see also [17–21]).
The strong product of two connected graphs and
, which is denoted by
, is a graph such that the set of vertices is
and two vertices
and
are adjacent in
if and only if, either (i)
and
is adjacent with
, or (ii)
is adjacent with
and
, or (iii)
is adjacent with
and
is adjacent with
.
It is easy to see that .
For a connected graph , there are four related graphs as follows:
(a) is the graph obtained by inserting an additional vertex in each edge of
. Equivalently, each edge of
is replaced by a path of length 2.
(b) is obtained from
by adding a new vertex corresponding to each edge of
, then joining each new vertex to the end vertices of the corresponding edge.
(c) is obtained from
by inserting a new vertex into each edge of
, then joining with edges those pairs of new vertices on adjacent edges of
.
(d) has as its vertices the edges and vertices of
. Adjacency in
is defined as adjacency or incidence for the corresponding elements of
.
The graphs and
are called the subdivision and total graph of
, respectively. For more details on these operations we refer the reader to [Citation22]. The graphs
and
are called the triangle parallel graph and the line superposition graph of
in [Citation23], respectively.
Note that (i) can be obtained by replacing each edge of
by a triangle, its vertex set is the union of
and
, and its edge set is the union of the respective edge sets of
and
; (ii)
is a graph on the same vertex set as
whose edge set is the union of the edge sets of
and the line graph
of
.
Yarahmadi et al. [Citation23] presented explicit formulas expressing the eccentric connectivity indices of in terms of the eccentric connectivity index of the original graph
and some auxiliary invariants.
If is
, then
and
are shown in (see [18,19]).
Based on the Cartesian product of two connected graphs
and
and the four types
of graphs resulting from edge subdivision above, M. Eliasi and B. Taeri [Citation21] introduced four new operations on these graphs.
The expression for the Wiener index of the
-sums of graph
in terms of
and
and the first and second Zagreb indices for the
-sums of graph were obtained in [Citation21] and [Citation18], respectively.
Also based on the strong product of two connected graphs
and
and the four types
of graphs resulting from edge subdivision, we also introduce four new operations on these graphs in the following:
Let . The
-sum of
and
, denoted by
, is defined by
, where
, i.e.,
is a graph with the set of vertices
and two vertices
and
of
are adjacent if and only if, either (i)
and
, or (ii)
and
, or (iii)
and
.
For any vertex , the degree of
in the
-strong product
is
,
,
and
are shown in .
In this work, we will study the F index for the -strong product of graphs.
2 The F index for ![](//:0)
-strong product of graphs
Firstly, we will give the expression for the F index of in terms of F index and Zagreb indices of graphs
and
.
Theorem 1
Let be a connected graph with
vertices and
edges,
. Then
Proof
For any vertex , the degree
of
is
For and
, if
and
, i.e.,
is a new vertex inserted on an edge incident to
, then
and
.
Then
and
Note that , we have
Hence,
Theorem 2
Let be a connected graph with
vertices and
edges,
. Then
Proof
Then
since
in
is
in
, i.e.,
.
Hence,
Theorem 3
Let be a connected graph with
vertices and
edges,
. Then
where
(du+dv)dudv
Proof
Then
as this summation is same in
.
Consider
In
,
and
occurs
times. Thus
Let
as
,
occurs two times. Therefore
Hence
Consider
In
, coefficient of
= 2
+
d(v) – d(u)
= – 2d(u) +
d(v)
Therefore,
For coefficient of dudv, let
with
and
. As
, we have either
or
or
or
. So
is adjacent to all those vertices in
which are adjacent to
and
. So number of such
is (
).
Therefore,
Hence,
Combining Theorems 2 and 3 we get
Theorem 4
Example 1
Applying theorems above to the graphs and
, we have
,
,
,
,
,
,
, where
,
, where
,
,
, where
,
,
and
. And
Example 2
Applying theorems above to the graphs and
, we have
,
,
,
,
,
,
,
, where
,
,
,
,
,
. And
Example 3
Applying theorems above to the graphs and
, we have
,
,
,
,
,
,
,
, where
,
,
,
, where
,
,
,
. And
3 Summary and conclusions
In this work, we study the F index of graphs based on operations related to the strong product, subdivision and total graph, and obtain the expressions for
,
,
and
in terms of F indices of
, the first Zagreb indices of
, and the second Zagreb index of
, and use them to compute the F index of
,
and
.
References
- GutmanI., TrinajstićN., Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons, Chem. Phys. Lett., 17 1972 535–538
- GutmanI., RučičB., TrinajstićN., WilcoxC.F., Graph theory and molecular orbitals. XII. Acyclic polyenes, J. Chem. Phys., 62 1975 3399–3405
- FurtulaB., GutmanI., A forgotten topological index, J. Math. Chem., 53 2015 1184–1190
- GaoW., SiddiquiM.K., ImranM., JamilM.K., FarahaniM.R., Forgotten topological index of chemical structure in drugs, Saudi Pharm. J., 24 2016 258–264
- CheZ., ChenZ., Lower and upper bounds of the forgotten topological index, MATCH Commun. Math. Comput. Chem., 76 2016 635–648
- AzariM., IranmaneshA., Chemical graphs constructed from rooted product and their Zagreb indices, MATCH Commun. Math. Comput. Chem., 70 2013 901–919
- AzariM., IranmaneshA., GutmanI., Zagreb indices of bridge and chain graphs, MATCH Commun. Math. Comput. Chem., 70 2013 921–938
- DasK.C., GutmanI., Some properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem., 52 2004 103–C112
- da FonsecaC.M., StevanovicD., Further properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem., 72 2014 655–668
- DengH., BalachandranS., AyyaswamyS.K., VenkatakrishnanY.B., On the average eccentricity, the harmonic index and the largest signless laplacian eigenvalue of a graph, Trans. Comb., 642017 43–50
- GutmanI., DasK.C., The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem., 50 2004 83–92
- LiuM., LiuB., Second Zagreb indices of unicyclic graphs with given degree sequences, Discrete Appl. Math., 167 2014 217–221
- YuanW., ZhangX., The second Zagreb indices of graphs with given degree sequences, Discrete Appl. Math., 185 2015 230–238
- HuY., LiX., ShiY., XuT., GutmanI., On molecular graphs with smallest and greatest zeroth-order general Randić index, MATCH Commun. Math. Comput. Chem., 5422005 425–434
- HuY., LiX., ShiY., XuT., Connected (n m)-graphs with minimum and maximum zeroth-order general Randić index, Discrete Appl. Math., 15582007 1044–1054
- LiX., ShiY., A survey on the Randić index, MATCH Commun. Math. Comput. Chem., 5912008 127–156
- KhalifehM.H., Yousefi-AzariH., AshrafiA.R., The first and second Zagreb indices of some graph operations, Discrete Appl. Math., 157 2009 804–811
- DengH., SaralaD., AyyaswamyS.K., BalachandranS., The Zagreb indices of four operations on graphs, Appl. Math. Comput., 275 2016 422–431
- SaralaD., DengH., AyyaswamyS.K., BalachandranS., The Zagreb indices of graphs based on four new operations related to the lexicographic product, Appl. Math. Comput., 309 2017 156–169
- AkhterShehnaz, ImranMuhammad, Computing the forgotten topological index of four operations on graphs, AKCE Int. J. Graphs Comb., 14 2017 70–79
- EliasiM., TaeriB., Four new sums of graphs and their Wiener indices, Discrete Appl. Math., 157 2009 794–803
- CvetkocićD.M., DoobM., SachsH., Spectra of Graphs Theory and Application 1980Academic Press New York
- YarahmadiZ., MoradiS., DošlićT., Eccentric connectivity index of graphs with subdivided edges, Electron. Notes Discrete Math., 45 2014 167–176