Abstract
In this article, we introduce the neighborhood versions of two classical topological indices, namely neighborhood geometric–arithmetic and neighborhood atom bond connectivity indices. We study the graph-theoretic properties of these new topological indices for some known graphs, e.g., complete graph , regular graph , cycle graph , star graph , pendant graph, and irregular graph and further establish their respective bounds. We note that the neighbourhood geometric–arithmetic index of , , , and is equal to the number of edges. The neighborhood atom bond connectivity index of an arbitrary simple graph is strictly less than the number of edges. Our results contribute to the literature in this direction.
Keywords:
degree-based topological indices; neigborhood degree sum; neigborhood topological indices; geometric–arithmetic index; atom bond connectivity index MSC:
05C07; 05C90; 05C92
1. Introduction
Let be an arbitrary graph, a topological index is a function Topological indices (TI) are graph invariants and are employed to describe the topology of graphs. Topological indices are very important in mathematical chemistry because they are used to model physiochemical properties of molecules and compounds. The molecules are illustrated as a simple connected graph; with atoms of chemical compound denoting vertices and the chemical bonds between them as edges. In 1947, Harold Wiener [1] introduced the first TI related to molecular branching, Wiener [1] showed that his TI is closely related to the boiling points of alkane molecules, his QSPR and QSAR analysis showed that it is also related with other quantities such as the parameters of its critical point, the density, surface tension, viscosity of its liquid phase, and van der Waals surface area of the molecule. The Wiener index is defined as
where represents off-diagonal elements of d. The success of Wiener’s work influenced the study of other TI of chemical graphs such as the Randic index which was introduced by Milan Randic [2] in 1975. The Randic index is also called the connectivity index is given as
where and are the degrees of vertices of the graph The Randic index was used to determine the topology of linear and branched alkanes with eight or less carbon atoms. Randic [2] further stated that the degree of branching of the molecular skeleton is very important in determining some molecular parameter such as boiling points of hydrocarbons. Computations from the showed that the numerical parameter obtained is in satisfactory agreement with the kovats retention index whose purpose is to determine the retention time interpolated between adjacent n-alkanes. This was a major success because it showed the efficiency of the in its applications to physical properties of molecules and compounds (see [2,3,4,5] for more details). For this reason, numerous researchers have devoted attention to the development of several TI (for example, Zagreb index [6,7,8], second Zagreb index [8], forgotten index [9], harmonic index [10], GA index [11], and ABC index [12]) and their applications to model molecules of higher carbon atoms. In 2014, Gutman et al. [13] studied the reciprocal of in (2). They defined the reciprocal form as follows:
and applied it to physico-chemical properties of octane isomers such as the standard enthalpy of formation and boiling points. Although has less computational advantage to . Furthermore, Vukievi and Furtula [11] introduced a new type of degree based TI known as geometric–arithmetic index which is given by
They discovered that the index can be used as a predictive tool in quantity structure–property relationship (QSPR) and quantity structure–activity relationship (QSAR) analysis. The predictive power was further tested on some physicochemical properties of octanes and the results obtained showed that the index gives a better predictive power than the in (2) (see [14,15,16,17,18,19,20,21] for details). Estrada et al. [12] introduced an important TI (which seems to be advantageous in applications) known as the Atom Bond Connectivity index ( index for short). The index is defined as:
It was noted in [12] that unlike the , the index does not show the level of branching of the molecule; rather, it described the heats of formation of alkanes, which gave a good correlation coefficient in the QSPR model () (see [12,17,22,23,24,25,26] for more details).
Recently, Mondal et al. [27] developed the concept of neighborhood TI. The neighborhood TI summed the degree of a distinct vertex over a distinct neighbor set. This new approach seems to be better in application especially for determining degeneration of TI (see [27]). In the pioneer work on neigborhood topological indices by Mondal et al. [27], they studied the neighborhood versions of forgotten index, Zagreb index, second Zagreb index, and hyper Zagreb index. They further applied it to model the regression analysis of n-octane isomers. Since then, neighborhood version of other classical TI have been studied (reciprocal Randic index, sum connectivity index, redefined third Zagreb index, Randic index, and symmetric division degree index. See [28] for more details).
Despite the rapid development of neighborhood versions of TI, we note that there are some classical TI that their neighborhood versions are yet to be studied. Motivated by this fact and the works of Vukičević et al. [11], Estrada et al. [12] and Mondal et al. [27], we introduce the neighborhood geometric–arithmetic index and atom bond connectivity index. We study the graph theoretic properties of the new TI and establish their respective bounds. Our result compliment other results in the literature.
2. Preliminaries
A graph can be defined as a triple where V is a finite nonempty set called set of vertices, E is a finite set (may be empty) called set of edges and f is the incidence function that assigns to each edge a one-element subset or two element subset . The degree of a vertex v on a graph , denoted by is the total number of edges associated with v. Let denotes the set of neighbors of v, the sum of the degrees of the neighbors of v is called the neighbor degree sum, denoted by and given by
The order of a graph is the number of vertices contained in the graph while the size of the graph is the number of edges contained in the graph, thus and . A simple graph is a graph that contains no multiple edges or loops. A connected graph is a graph that has a path between every pair of vertices in the graph. A regular graph is a simple graph where every vertex has the same vertex degree. A complete graph is a simple graph in which every pair of distinct vertices is connected by a unique edge. A cycle graph is a simple graph that consists of a single cycle. A pendant vertex is a vertex that has degree 1 i.e., . An irregular graph is a graph in which all vertices have a unique degree. A star graph is a connected graph in which there exists at most one vertex with a degree greater than one [29,30]. Henceforth, all graphs considered in this article are simple and finite.
Definition 1.
Let be a graph, and be the neighbor degrees of vertices u and v, respectively. The
- (i)
- neighborhood first Zagreb index [27] is given by
- (ii)
- neighborhood hyper Zagreb index [27] is given by
- (iii)
- neighborhood second Zagreb index [27] is given by
- (iv)
- neighborhood forgotten topological index [27] is given by
- (v)
- neighborhood modified version of forgotten topological index [27] is given by
- (vi)
- neighborhood harmonic index [28] is given by
- (vii)
- neighborhood Randic index [28] is given by
- (viii)
- neighborhood inverse Randic index [28] is given by
The following are important inequalities used in establishing our results.
Lemma 1.
(Cauchy-Schwarz Inequality, [31]). Let and be real numbers for all then
Equality holds if and only if for some constant k for each .
Lemma 2.
(Chebyshev’s inequality, [31,32]). Let and be real numbers then we have
or
Equality occurs if and only if or .
Lemma 3.
(Inequalities between Means, [31]). Let and let
then , equality occurs if and only if where = quadratic mean, = arithmetic mean, = geometric mean, and = harmonic mean.
Lemma 4.
([31]). Let and be two sequences of non-negative real numbers and , such that and then
Lemma 5.
(Diaz-Metcalf inequality, [24]). Let and be two sequences of real numbers with and such that then
Equality holds if and only if either or for every .
3. Main Results
We begin this section by introducing neighborhood versions of two degree based topological indices, namely the GA index and ABC index. We establish their bounds for some graphs.
Definition 2.
Let be a graph and let and be the neighbor degree sums of vertices u and v, respectively; then, the neighborhood GA index is given by
where .
Definition 3.
Let be a graph and let and be the neighbor degree sums of vertices u and v, respectively; then, the neighborhood ABC index is given by
where .
Using the above definitions, we compute the bounds of and for some classical graphs such as irregular graphs and pendant graphs. The following remarks will be important in establishing our result.
Remark 1.
We denote and . If is a complete, regular, cycle or star graph then i.e., .
Remark 2.
If is a complete, regular or cycle graph then .
3.1. Bounds for Neighborhood Geometric–Arithmetic () Index of Graphs
Theorem 1.
Let be a complete, regular, cycle or star graph with m-edges then
Proof.
From Remark 2, we have
Since is a or graph then the neighborhood degree sum of a pair is 1. Therefore, if we take the summation of the neighborhood degree for all we obtain
□
Theorem 2.
Let be a star graph then
Proof.
Let be a star graph and holds for . Since
then it follows from Lemma 3 that
which implies that
Let and , substituting these in (28) we obtain
which implies
and therefore from Theorem (23) we obtain
□
Theorem 3.
Let be a complete, regular or cycle graph with m-edges. Then,
Proof.
From Definition 2, if and then
Therefore,
This completes the proof. □
Theorem 4.
Let be a pendant graph then
Theorem 5.
Let be a any graph
Proof.
Taking square root of both sides yields
□
Theorem 6.
Let be any graph then
Theorem 7.
Let be a star graph with m-edges then
3.2. Bounds for Neighborhood Atom Bond Connectivity Index of Graphs
The following remark is an analogue of the properties of the classical index studied by Das et al. [24]. The properties also follows for neighborhood version of index.
Remark 3.
If is a complete, regular, cycle or star graph then
Theorem 8.
Let be any graph then
Proof.
Using Lemma 4 on (55), let and let and ; then, we have
□
Theorem 9.
Let be a star graph then,
Proof.
From Definition 3, let and
Since is a star graph then the neighborhood degree sum of a pair is . Therefore, if we take the summation of the neighborhood degree for all we obtain
□
Theorem 10.
Let be any graph then
Equality holds if and only if is a regular, complete, or star graph.
Proof.
Taking square root of both sides,
Hence,
□
Theorem 11.
Let be any graph and m the number of edges in . Then,
We conclude this section with the following consequence from the classical and neighborhood versions of and indices.
Corollary 1.
Let and be geometric–arithmetic index, atom bond connectivity index, neighborhood geometric–arithmetic index, and neighborhood atom bond connectivity index; then, the following inequalities hold:
- (i)
- If is a star graph, then .
- (ii)
- If is a regular, cycle, or complete graph, then .
- (iii)
- If is a pendant graph, then .
- (iv)
- If is an irregular graph, then .
- (v)
- If is any graph, then .
4. Conclusions
In this article, we have introduced and studied the neighborhood geometric–arithmetic index and neighborhood atom bond connectivity index for some known graphs. We have established the lower and upper bounds of and for some known graphs. In our future studies, we are going to demonstrate the priority and usage of our new neighborhood topological indices against other types of topological indices in QSPR/QSAR analysis of drugs. Unlike the normal SPSS adopted for QSPR/QSAR, we plan to adopt the support vector machine algorithm of machine learning.
Author Contributions
Conceptualization of the article was given by M.S.A., K.O.A. and M.A.; methodology by M.S.A. and K.O.A.; validation by K.O.A. and M.A.; formal analysis, investigation, data curation, and writing—original draft preparation by M.S.A., K.O.A. and M.A.; resources by K.O.A. and M.A.; writing—review and editing by M.S.A., K.O.A. and M.A.; visualization by K.O.A. and M.A.; and project administration by K.O.A. All authors have read and agreed to the published version of the manuscript.
Funding
The APC was funded by the Department of Mathematics and Applied Mathematics, Sefako Makgatho Health Sciences, Pretoria, South Africa.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 1, 17–20. [Google Scholar] [CrossRef] [Scilit]
- Randic, M. On Characterization of molecular branching. J. Am. Chem. Soc. 1975, 97, 6609–6615. [Google Scholar] [CrossRef] [Scilit]
- Li, X.; Shi, Y. A survey on the Randic index. MATCH Commun. Math. Comput. Chem. 2008, 59, 127–156. [Google Scholar]
- Zhou, B.; Luo, W. A note on general Randic index. Match 2009, 62, 155. [Google Scholar]
- Maallah, R.L.; Khalaf, A.J.M. Randic and General Randic Indcies of Unicyclic Graphs. Saudi J. Eng. Technol. 2017, 2, 274–279. [Google Scholar] [CrossRef]
- Gutman, I.; Trinajstić, N. Graph theory and molecular orbitals. In New Concepts II; Springer: Berlin/Heidelberg, Germany, 1973; pp. 49–93. [Google Scholar]
- Gutman, I.; Das, K.C. The first Zagreb index 30 years after. MATCH Commun. Math. Comput. Chem. 2004, 50, 83–92. [Google Scholar]
- Gutman, I.; Rućić, B.; Trinajstić, N.; Wilcox, C.F., Jr. Graph theory and molecular orbitals. XII. Acyclic polyenes. J. Chem. Phys. 1975, 62, 3399–3405. [Google Scholar] [CrossRef] [Scilit]
- Furtula, B.; Gutman, I. A forgotten topological index. J. Math. Chem. 2015, 53, 1184–1190. [Google Scholar] [CrossRef] [Scilit]
- Zhong, L. The harmonic index for graphs. Appl. Math. Lett. 2012, 25, 561–566. [Google Scholar] [CrossRef] [Scilit]
- Vukičević, D.; Furtula, B. Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem. 2009, 46, 1369–1376. [Google Scholar] [CrossRef] [Scilit]
- Estrada, E.; Torres, L.; Rodriguez, L.; Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes. Indian J. Chem. 1998, 37, 849–855. [Google Scholar]
- Gutman, I.; Furtula, B.; Elphick, C. Three new/old vertex degree- based topological indices. MATCH Commun. Math. Comput. Chem. 2014, 72, 617–632. [Google Scholar]
- Granados, A.; Portilla, A.; Garcia, J.M.; Rodriguez, J.M.; Almira, J.M.S. Inequalities on the geometric-arithmetic index. Hacet. J. Math. Stat. 2021, 50, 778–794. [Google Scholar] [CrossRef] [Scilit]
- Asif, M.; Almohamedh, H.; Hussain, M.; Alhamed, K.M.; Almutairi, A.A.; Almotairi, S. An approach to the geometric-arithmetic index for graphs under transformations’ fact over pendent paths. Complexity 2021, 2021, 3745862. [Google Scholar] [CrossRef] [Scilit]
- Das, K.C. On geometric-arithmetic index of graphs. MATCH Commun. Math. Comput. Chem. 2010, 64, 619–630. [Google Scholar] [CrossRef] [Scilit]
- Gutman, I. Degree based topological indices. Croat. Chem. Acta 2013, 86, 351–361. [Google Scholar] [CrossRef] [Scilit]
- Portilla, A.; Rodrıguez, J.M.; Sigaretta, J.M. Recent lower bounds for geometric-arithmetic index. Discret. Math. Lett. 2019, 1, 59–82. [Google Scholar]
- Rodrıguez, J.M.; Sigaretta, J.M. On the geometric–arithmetic index. MATCH Commun. Math. Comput. Chem. 2015, 74, 103–120. [Google Scholar]
- Stankov, S.; Matejić, M.; Milovanović, I.; Milovanović, E. Some mathematical properties of the geometric-arithmetic index/coindex of graphs. Filomat 2021, 35, 5045–5057. [Google Scholar] [CrossRef] [Scilit]
- Yuan, Y.; Zhou, B.; Trinajstić, N. On geometric-arithmetic index. J. Math. Chem. 2010, 47, 833–841. [Google Scholar] [CrossRef] [Scilit]
- Ali, A.; Das, K.C.; Dimitrov, D.; Furtula, B. Atom–bond connectivity index of graphs: A review over extremal results and bounds. Discret. Math. Lett. 2021, 5, 68–93. [Google Scholar]
- Chaluvaraju, B.; Shaikh, A.B. Different versions of atom-bond connectivity indices of some molecular structures: Applied for the treatment and prevention of COVID-19. Polycycl. Aromat. Compd. 2021, 42, 3748–3761. [Google Scholar] [CrossRef] [Scilit]
- Das, K.C.; Elumalai, S.; Gutman, I. On ABC index of graphs. MATCH Commun. Math. Comput. Chem. 2017, 78, 459–468. [Google Scholar]
- Das, K.C. Atom-bond connectivity index of graphs. Discret. Appl. Math. 2010, 158, 1181–1188. [Google Scholar] [CrossRef] [Scilit]
- Zukia, W.N.N.N.W.; Hasnia, R.; Husina, N.H.M.; Dub, Z.; Raheemc, A. On the difference between geometric-arithmetic index and atom-bond connectivity index for trees. J. Math. Comput. Sci. 2021, 2, 49–58. [Google Scholar]
- Mondal, S.; De, N.; Pal, A. On some new neighborhood degree based indices. Acta Chem. Iasi 2019, 27, 31–46. [Google Scholar] [CrossRef] [Scilit]
- Mondal, S.; Dey, A.; De, N.; Pal, A. QSPR analysis of some novel neighbourhood degree-based topological descriptors. Complex Intell. Syst. 2021, 7, 977–996. [Google Scholar] [CrossRef] [Scilit]
- Chartrand, G.; Zhang, P. A First Course in Graph Theory; Courier Corporation: Mineola, NY, USA, 2013. [Google Scholar]
- Walis, W.D. A Beginner’s Guide to Graph Theory; Springer Science and Business Media: Birkhauser/Berlin, Germany, 2007. [Google Scholar]
- Cvetkovski, Z. Inequalities Theorems, Techniques and Selected Problems; Springer: Berlin/Heidelberg, Germany, 2010; Volume 107. [Google Scholar]
- Sedrakyan, H.; Sedrakyan, N. Algebraic Inequalities; Springer: New York, NY, USA, 2018. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).