![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
The properties of chemical compounds are very important for the studies of the non-isomorphism phenomenon's related to the molecular graphs. Topological indices (TIs) are one of the mathematical tools which are used to study these properties. Gutman and Trinajsti [Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem Phys Lett. 1972;17(4):535–538] defined the Zagreb indices (descriptors) to find correlation value between a molecular graph and its total π-electron energy. Later on, Bollobás and Erdös [Graphs of extremal weights. Ars Comb; 1998;50:225–233] defined the most general form of these indices (descriptors) called by general Randić index (GRI) and first general Zagreb index (FGZI), respectively. In this paper, we computed the bounds for FGZI and GRI of φ-sum graphs, obtained by the strong product of the graph with another graph Γ, where
is constructed using four subdivision operations on the graph G. At the end, we also include the results for some particular families of graphs as the applications of the obtained results.
1. Introduction
A number, polynomial or a matrix can uniquely identify a graph and a topological index (TI) of a molecular graph is a numeric number that can be defined as a function , where
is a class of molecular graphs and
is a set of real numbers. TI's are classified into different classes but degree-based are most familiar, see [Citation1]. These are used to characterize the physicochemical properties of chemical compounds of the molecular graphs like surface tension
density, melting
freezing point, heat of evaporation
formation and solubility, see [Citation2–4]. TI's are also used in the studies of the structural properties of computer-based networks such as clustering, connectivity, modularity, robustness and vulnerability, see [Citation5].
In computational graph theory, the concept of formation of the new graphs by using some operations is studied widely. For a connected molecular graph G, Yan et al. [Citation6] defined the new graphs called as line graph , subdivided graph
, triangle parallel graph
, line superposition graph
and total graph
using the subdivision related operations L, S, R, Q and T on G, respectively. They also obtained the Wiener index of these new resultant graphs
, where
. Eliasi et al. [Citation7] defined the φ-sum graphs
using the operation of cartesian product on the graphs
and Γ. They also obtained the Wiener index of these φ-sum graphs
,
,
and
. The first, second and forgotten zagreb indices of the φ-sum graphs are computed in [Citation8,Citation9]. The first general Zagreb index and general sum-connectivity index of the aforesaid cartesian product-based φ-sum graphs are obtained in the form of exact formulas and bounds, see [Citation10–12]. For further studies of the TIs on the graphs obtained by the various operations of graphs, we refer to [Citation13–21].
Recently, Sarala et al. [Citation22] obtained the F-index of the strong product based φ-sum graphs. The theme of this note is to compute FGZI and GRI of φ-sum graphs constructed by the strong product of graphs
and Γ, where
. The remaining paper is organized as: Section 2 contains some basic definitions and operations on graphs G and
, Section 3 covers the main results of upper and lower bounds of FGZI and GRI and Section 4 is devoted to conclusion.
2. Preliminaries
Let G = ,
be an undirected, simple, finite and connected molecular graph with vertex set
and edge set
such that each vertex presents atom and each edge shows the bonding among the atoms. Degree of u in G is
. The maximum and minimum degrees of a graph G are defined as
and
. We note that
, where equality holds if and only if G is a regular graph. For further study of graph-theocratic terminologies, see [Citation23–25]. Now, we define some important degree-based TIs.
Definition 2.1
For a molecular graph G, the first and second Zagreb indices (descriptors) are defined as:
In 1972, Gutman and Trinajsti defined these indices (descriptors) to study the molecular graphs, see [Citation26–28].
Definition 2.2
[Citation29,Citation30]
First general Zagreb (FGZ) and general Randi (GR) indices of a molecular graph G are
respectively, where
and β are real numbers. Moreover, for
and
, FGZI becomes first Zagreb index and forgotten topological index. Similarly, for
and
, GRI becomes second Zagreb index and classical Randić index respectively, see [Citation26–32].
Operations of Subdivision: The following operations are defined in [Citation7].
is obtained by adding a new vertex in each edge of G.
To obtain
, in
join end (original) vertices of the edges which are incident on each new vertex.
To obtain
, in
join those pairs of new vertices by edges which have common adjacent (original) vertices.
If both
and
are applied at the same on
, we obtain
.
Figure illustrates the foresaid operations of the subdivision of graphs.
Definition 2.3
For ,
is a graph obtained by the operation φ on graph G with the vertices
and the edges
. Then, φ-sum graph
based on strong product of graphs
and Γ is a graph with vertex set
such that two vertices
and
of
are adjacent iff, either [
ε
and
ε
] or [
ε
and
ε
] or [
ε
and
ε
], see Figure .
Remark 2.4
For any vertex , the degree of
(denoted by
) can be defined as
3. Main results
This section contains the main results of φ-sum graphs based on strong product. Assume that the connected graphs G and Γ have number of vertices and
, and number of edges
and
, respectively.
Theorem 3.1
Let G and Γ be two connected graph.
We have
where
and
We have
where
and
Proof.
By definition
In terms of edges, where
Consider,
It is clear that
=
and
=
. Therefore ∀
ε
ε
with
ε
,
ε
we have
Now ∀
ε
such that
ε
and
ε
, we have
Consequently,
Similarly, we can compute
equality holds iff G and Γ are regular graphs.
Consider,
Therefore,
Similarly, we can compute
equality holds iff G and Γ are regular graphs.
Theorem 3.2
Let G and Γ be two connected graph.
We have
, where
,
and
We have
, where
,
and
Proof.
By definition
Since
=
also for
ε
and
ε
. If
ε
then
=
. If
ε
then
= 2.
Hence
Similarly
equality holds iff G and Γ are regular graphs.
Consider,
Consequently,
Similarly, we can compute
equality holds iff G and Γ are regular graphs.
Theorem 3.3
Let G and Γ be two connected graph.
We have
, where
,
and
We have
, where
,
and
Proof.
By definition
Consider,
Note that
=
for
],
is the vertex inserted into the edge
of G for all
,
ε
, we have
Since
is vertex inserted in the edge
of G and
is vertex inserted in the edge
of G for all
,
ε
, we have
Hence
Similarly, we can compute
equality holds iff G and Γ are regular graphs.
Consider,
Now
, we can write
Consequently,
Similarly, we can compute
equality holds iff G and Γ are regular graphs.
Theorem 3.4
Let G and Γ be two connected graph.
We have
, where
and
We have
where
and
equality holds iff G and Γ are regular graphs.
4. Applications and discussion
The upper and lower bounds on the FGZI and GRI of for α, β > 0 are given as follows:
For S-sum graph :
For R-sum graph :
For Q-sum graph :
For T-sum graph :
Now, we present the numerical values of FGZI and GRI for
with the help of the above bounds under the assumption that
and
in Tables –. Moreover, Tables and present the exact values of FGZI and GRI for the same graphs (Figures –).
Figure 3. Comparison between bounds and exact values of FGZI GRI index: In first graph
by blue colour, exact value of FGZI by green colour and
by red colour are presented. Similarly, in second graph
by blue colour, exact value of GRI by green colour and
by red colour are presented.
![Figure 3. Comparison between bounds and exact values of FGZI & GRI index: In first graph α1 by blue colour, exact value of FGZI by green colour and α2 by red colour are presented. Similarly, in second graph β1 by blue colour, exact value of GRI by green colour and β2 by red colour are presented.](/cms/asset/63b4198f-20c5-441e-9962-1812887074c6/tusc_a_1819026_f0003_oc.jpg)
Figure 4. Comparison between bounds and exact values of FGZI GRI: In first graph
by green colour, exact value of FGZI by pink colour and
by purple colour are presented. Similarly, in second graph
by purple colour, exact value of GRI by green colour and
by red colour are presented.
![Figure 4. Comparison between bounds and exact values of FGZI & GRI: In first graph α1 by green colour, exact value of FGZI by pink colour and α2 by purple colour are presented. Similarly, in second graph β1 by purple colour, exact value of GRI by green colour and β2 by red colour are presented.](/cms/asset/ac0c386f-1cfc-4053-95d8-9f60b7346aa2/tusc_a_1819026_f0004_oc.jpg)
Figure 5. Comparison of bounds and exact values of FGZI GRI: In first graph
by blue colour, exact value of FGZI by purple colour and
by red colour are presented. In second graph,
by purple colour, exact value of GRI by green colour and
by red colour are presented.
![Figure 5. Comparison of bounds and exact values of FGZI & GRI: In first graph α1 by blue colour, exact value of FGZI by purple colour and α2 by red colour are presented. In second graph, β1 by purple colour, exact value of GRI by green colour and β2 by red colour are presented.](/cms/asset/e7eb1e8f-53f1-42a3-a4f0-e4df354144f0/tusc_a_1819026_f0005_oc.jpg)
Figure 6. Comparison of bounds and exact values of FGZI GRI: In first graph
by green colour, exact value of FGZI by purple colour and
by red colour are presented. Similarly, in second graph,
by purple colour, exact value of GRI by blue colour and
by red colour are presented.
![Figure 6. Comparison of bounds and exact values of FGZI & GRI: In first graph α1 by green colour, exact value of FGZI by purple colour and α2 by red colour are presented. Similarly, in second graph, β1 by purple colour, exact value of GRI by blue colour and β2 by red colour are presented.](/cms/asset/8d3a1cfb-f124-41cd-a203-acb4af9d18d1/tusc_a_1819026_f0006_oc.jpg)
Table 1. ![](//:0)
.
Table 2. ![](//:0)
.
Table 3. ![](//:0)
.
Table 4. ![](//:0)
.
Table 5. Exact values for FGZI.
Table 6. Exact values for GRI.
5. Conclusion
In this paper, we have computed the bounds (upper and lower) for FGZI and GRI of φ-sum graphs which are obtained by the strong product of graph with another graph Γ, where
is constructed using four subdivision operations on the graph G. At the end, we also included the results for some particular families of graphs as the applications of the obtained results and concluded that the exact values satisfy the obtained bounds. More preciously, upper and lower bounds for FGZI and GRI of φ-sum graphs based on strong product are computed, where
. In addition, if we assume that
then these bounds become
and
.
Acknowledgments
The author is deeply thankful to the editor and the reviewers for their valuable suggestions to improve the quality of this manuscript.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
References
- Gutman I. Degree-based topological indices. Croat Chem Acta. 2013;86(4):351–361. doi: 10.5562/cca2294
- Javaid M, Cao J. Computing topological indices of probabilistic neural network. Neural Comput Appl. 2018;30(12):3869–3876. doi: 10.1007/s00521-017-2972-1
- Devillers J, Balaban AT. Topological indices and related descriptors in QSAR and QSPR. Amsterdam: Gordon and Breach Science Publishers; 1999.
- Randic M. Characterization of molecular branching. J Am Chem Soc. 1975;97(23):6609–6615. doi: 10.1021/ja00856a001
- Van Steen M. Graph theory and complex networks: an introduction. Maarten van Steen; 2010. 144p.
- Yan W, Yang BY, Yeh YN. The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl Math Lett. 2007;20(3):290–295. doi: 10.1016/j.aml.2006.04.010
- Eliasi M, Taeri B. Four new sums of graphs and their Wiener indices. Discrete Appl Math. 2009;157(4):794–803. doi: 10.1016/j.dam.2008.07.001
- Deng H, Sarala D, Ayyaswamy SK, et al. The Zagreb indices of four operations on graphs. Appl Math Comput. 2016;275:422–431.
- Liu JB, Javed S, Javaid M, et al. Computing first general Zagreb index of operations on graphs. IEEE Access. 2019;7:47494–47502. doi: 10.1109/ACCESS.2019.2909822
- Akhter S, Imran M. The sharp bounds on general sum-connectivity index of four operations on graphs. J Inequalities Appl. 2016;2016(1):102. doi: 10.1186/s13660-016-1048-6
- Ahmad M, Saeed M, Javaid M, et al. Exact formula and improved bounds for general sum-connectivity index of graph-operations. IEEE Access. 2019;7:167290–167299.
- Akhter S, Imran M. Computing the forgotten topological index of four operations on graphs. AKCE Int J Graphs Comb. 2017;14(1):70–79. doi: 10.1016/j.akcej.2016.11.012
- Lokesha V, Shetty BS, Ranjini PS, et al. New bounds for randic and GA indices. J Inequalities Appl. 2013;2013(1):180. doi: 10.1186/1029-242X-2013-180
- Das KC, Akgunes N, Togan M, et al. On the first Zagreb index and multiplicative Zagreb coindices of graphs. Anal Univ “Ovidius” Constanta-Seria Mat. 2016;24(1):153–176. doi: 10.1515/auom-2016-0008
- Lokesha V, Shruti R, Ranjini P, et al. On certain topological indices of nanostructures using Q (G) and R (G) operators. Commun Fac Sci Univ Ank Ser A1 Math Stat. 2018;67(2):178–187.
- Togan M, Yurttas A, Cevik AS, et al. Zagreb indices and multiplicative Zagreb indices of double graphs of subdivision graphs. TWMS J Appl Eng Math. 2019;9(2):404.
- Lokesha V, Shruti R, Cevik AS. M-polynomial of subdivision and complementary graphs of banana tree graph. J Int Math Virtual Inst. 2020;10(1):157–182.
- Cevik AS, Lokesha V, Jain S, et al. New results on the F-index of graphs based on corona-type products of graphs. Proc Jangjeon Math Soc. 2020;23(2):141–147.
- Das KC, Yurttas A, Togan M, et al. The multiplicative Zagreb indices of graph operations. J Inequalities Appl. 2013;2013(1):90. doi: 10.1186/1029-242X-2013-90
- Liu JB, Javaid M, Awais HM. Computing Zagreb indices of the subdivision-related generalized operations of graphs. IEEE Access. 2019;7:105479–105488.
- Awais H, Javaid M, Jamal M. Forgotten index of generalized F-sum graphs. J Prime Res Math. 2019;15:115–128.
- Sarala D, Deng H, Natarajan C, et al. F index of graphs based on four new operations related to the strong product. AKCE Int J Gr Comb. 2018. doi: 10.1016/j.akcej.2018.07.003
- West DB. Introduction to graph theory. Upper Saddle River (NJ): Prentice Hall; 1996.
- Zhang X, Awais HM, Javaid M, et al. Multiplicative Zagreb indices of molecular graphs. J Chem. 2019;5294198. doi: 10.1155/2019/5294198
- Awais HM, Javaid M, Raheem A. Hyper-Zagreb index of graphs based on generalized subdivision related operations. Punjab Univ J Math. 2020;52(5):89–103.
- Gutman I, Trinajstić N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem Phys Lett. 1972;17(4):535–538. doi: 10.1016/0009-2614(72)85099-1
- Randić M. Characterization of molecular branching. J Am Chem Soc. 1975;97(23):6609–6615. doi: 10.1021/ja00856a001
- Bollobàs B, Erdös P. Graphs of extremal weights. Ars Comb. 1998;50:225–233.
- Li X, Zheng J. A unified approach to the extremal trees for different indices. MATCH Commun Math Comput Chem. 2005;54(1):195–208.
- Ahmad H, Seadawy AR, Khan TA, et al. Analytic approximate solutions for some nonlinear parabolic dynamical wave equations. J Taibah Univ Sci. 2020;14(1):346–358. doi: 10.1080/16583655.2020.1741943
- Özkan YS, Yaar E, Seadawy AR. A third-order nonlinear Schrödinger equation: the exact solutions, group-invariant solutions and conservation laws. J Taibah Univ Sci. 2020;14(1):585–597. doi: 10.1080/16583655.2020.1760513
- Marin M, Othman MI, Seadawy AR, et al. A domain of influence in the Moore–Gibson–Thompson theory of dipolar bodies. J Taibah Univ Sci. 2020;14(1):653–660. doi: 10.1080/16583655.2020.1763664