Abstract
The Zagreb eccentricity indices are the eccentricity reformulation of the Zagreb indices. Let be a simple graph. The first Zagreb eccentricity index () is defined to be the summation of squares of the eccentricity of vertices, i.e., . The second Zagreb eccentricity index () is the summation of product of the eccentricities of the adjacent vertices, i.e., . We obtain the thorny graph of a graph by attaching thorns i.e., vertices of degree one to every vertex of . In this paper, we will find closed formulation for the first Zagreb eccentricity index and second Zagreb eccentricity index of different well known classes of thorny graphs.
1. Introduction
In theoretical chemistry, molecular descriptors or topological indices are utilized to configure properties of chemical compounds. A topological index is a real number connected with chemical structure indicating relationships of chemical configuration with different physical properties, chemical reactivity or biological activity, which is utilized to understand properties of chemical compounds in theoretical chemistry. Topological indices have been observed to be helpful in chemical documentation, isomer discrimination, structure-property relations, structure-activity (SAR) relations and pharmaceutical medication plans. All through the paper, all graphs are considered to be simple and connected.
Let be a simple graph with vertices and edges. For , degree of u, denoted by , is number of vertices attached to in the graph. The maximum distance from a vertex to any other vertex in the graph is called eccentricity of the vertex and is denoted by i.e., , where denotes the distance between and in . The first Zagreb index () and second Zagreb index are the oldest known indices introduced by Gutman and Trinajstić [1] defined as
Several topological indices depend upon the eccentricity of the vertices and are very effective in drug design. Sharma, Goswami and Madan [2] proposed the eccentric connectivity index of the graph , which is defined as
In 2000, Gupta, Singh and Madan [3] introduced another distance-cum-degree based topological descriptor termed the connective eccentricity index:
Other eccentricity related indices include the eccentric distance sum [4], augmented and super augmented eccentric connectivity indices [5,6,7], and adjacent eccentric distance sum index [8,9].
Recently, the first Zagreb eccentricity index and second Zagreb eccentricity index and have been proposed as the revised versions of the Zagreb indices and , respectively, by Ghorbani and Hosseinzadeh [10]. The first Zagreb eccentricity index () and the second Zagreb eccentricity index () of a graph are defined as
respectively. Das et al. [11] gave a few lower and upper bounds on the first Zagreb eccentricity index and the second Zagreb eccentricity index of trees and graphs, and also characterized the extremal graphs. Nilanjan [12] computed a few new lower and upper bounds on the first Zagreb eccentricity index and the second Zagreb eccentricity index. Zhaoyang and Jianliang [13] computed Zagreb eccentricity indices under different graph operations. Farahani [14] computed precise equations for the First Zagreb Eccentricity index of Polycyclic Aromatic Hydrocarbons. Evidently, Zagreb indices and the family of all connectivity indices express mathematically attractive invariants. In this manner, we expect numerous more studies on these indices and anticipate further development of this area of mathematical chemistry.
2. Results and Discussion
Consider a graph with vertex set and a set of positive integers . The thorn graph of , denoted by , is obtained by attaching pendant vertices to for each . The idea of a thorn graph was presented by Gutman [15], and various studies on thorn graphs and different topological indices have been conducted by some researchers in the recent past [16,17,18,19]. In this paper, we will derive explicit expressions for computing the first Zagreb eccentricity index and the second Zagreb eccentricity index of thorny graphs of some well-known classes of graphs like complete graphs, complete bipartite graphs, star graphs, cycles and paths.
2.1. The Thorny Complete Graph
Suppose that we take the complete graph with vertices. Obviously, and . The thorny complete graph is obtained from by attaching thorns at each vertex of , . Suppose that the total number of thorns attached to are denoted by .
Theorem 1.
The first Zagreb eccentricity index and the second Zagreb eccentricity index of are given by:
Proof.
Let be a compete graph. Suppose that , are the vertices of , and , are the newly attached pendant vertices. Then, , for are the eccentricities of the vertices of . Thus, the first Zagreb eccentricity index and the second Zagreb eccentricity index of are given by
2.2. The Thorny Complete Bipartite Graph
Assume that we take the complete bipartite graph having vertices. Obviously, the eccentricities are equal to two for all the vertices of . Then, and . The thorny complete bipartite graph is attained by attaching pendant vertices to each vertex of . Let be the total number of pendent vertices.
Theorem 2.
The first Zagreb eccentricity index and the second Zagreb eccentricity index of are given by:
Proof.
Suppose that is the vertex set of , and let be the newly attached pendant vertices to , and be the pendant vertices of . Then, the eccentricity of the vertices of is given by , , for and , , for . Thus, the Zagreb eccentricity indices of are given by:
The second Zagreb eccentricity index is computed as:
2.3. The Thorny Star Graph
Suppose that we have the star graph of vertices. Obviously, and . Let the thorny star graph be obtained by joining pendant vertices to every vertex , and pendant vertices to the central vertex of .
Theorem 3.
The first Zagreb eccentricity index and the second Zagreb eccentricity index of are given by:
Proof.
Assume , and , for are the newly attached pendant vertices. Then, the eccentricities of the vertices of are given by , , for , , for , , for . Thus, the Zagreb eccentricity indices of are
from which we get the desired result. Now,
and the result follows.
2.4. The Thorny Cycle
Let be a cycle having vertices and edges. Clearly, , if is odd and , if is even. Let be the thorny cycle of obtained by joining thorns to each vertex , of .
Theorem 4.
The first Zagreb eccentricity index and the second Zagreb eccentricity index of are given by
and
respectively.
Proof.
The vertex eccentricities of are given as and , if is odd; and , if is even; for .
Thus, when is an odd number, the first Zagreb eccentricity index of is
and the second Zagreb eccentricity index of is
Now, when is an even number, the first Zagreb eccentricity index of is given by
Next, we proceed for the second Zagreb eccentricity index as
2.5. The Thorny Path Graph
Consider the path graph with vertices. If m is even, then we write , and suppose that the vertices of are serially indicated by , where the centers of the path are and having eccentricity . If is odd, then we write , and we suppose that we have as the consecutive vertices of , where the center of the path is having the eccentricity . Then, the thorny path graph is obtained from by attaching and pendant vertices to each and , respectively. We define . Now, we will find the first Zagreb eccentricity index and the second Zagreb eccentricity index of .
Theorem 5.
The first Zagreb eccentricity index and the second Zagreb eccentricity index of are given by
and
respectively.
Proof.
If , then all the vertices of have eccentricities , for , for . Thus, the Zagreb eccentricity indices of are given by
and
In addition,
and the result follows.
If is odd, then the vertices of have the eccentricities, , for , for (the equalities do not apply for and ). Now, the Zagreb eccentricity indices of are given as
In addition,
and we get the desired result.
Now,
In addition,
and we obtain the equality.
3. Conclusions
In this article we computed closed formulas for computing first Zagreb eccentricity index as well as second Zagreb eccentricity index for thorny graphs of important families of graphs like complete graph, complete bipartite graph, cycle, star and path. These relations are given in Theorems 1–4. Moreover, it can be observed from these formulas that values of these indices increase by increasing the number of vertices and number of thorns attached to graphs. These invariants have applications in computational chemistry.
Acknowledgments
The authors are highly grateful to the referees for their valuable comments, which led to great improvement of the original manuscript.
Author Contributions
Nazeran Idrees, Muhammad Jawwad Saif, Asia Rauf and Saba Mustafa contributed equally in computation of results, writing the manuscript and proofreading. All authors have read and approved the final manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Gutman, I.; Trinajstić, N. Graph theory and molecular orbitals. Total pi-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
- Sharma, V.; Goswami, R.; Madan, A.K. Eccentric Connectivity Index: A Novel Highly Discriminating Topological Descriptor for Structure-Property and Structure-Activity Studies. J. Chem. Inf. Comput. Sci. 1997, 37, 273–282. [Google Scholar] [CrossRef]
- Gupta, S.; Singh, M.; Madan, A.K. Connective eccentricity index: A novel topological descriptor for predicting biological activity. J. Mol. Graph. Model. 2000, 18, 18–25. [Google Scholar] [CrossRef]
- Gupta, S.; Singh, M.; Madan, A.K. Eccentric distance sum: A novel graph invariant for predicting biological and physical properties. J. Math. Anal. Appl. 2002, 275, 386–401. [Google Scholar] [CrossRef]
- Bajaj, S.; Sambi, S.S.; Gupta, S.; Madan, A.K. Model for prediction of anti-HIV activity of 2-pyridinone derivatives using novel topological descriptor. QSAR Comb. Sci. 2006, 25, 813–823. [Google Scholar] [CrossRef]
- Dureja, H.; Gupta, S.; Madan, A.K. Predicting anti-HIV-1 activity of 6-arylbenzonitriles: Computational approach using superaugmented eccentric connectivity topochemical indices. J. Mol. Graph. Model. 2008, 26, 1020–1029. [Google Scholar] [CrossRef] [PubMed]
- Sedlar, J. On augmented eccentric connectivity index of graphs and trees. MATCH Commun. Math. Comput. Chem. 2012, 68, 325–342. [Google Scholar]
- Sardana, S.; Madan, A.K. Predicting anti-HIV activity of TIBO derivatives: A computational approach using a novel topological descriptor. J. Mol. Model. 2002, 8, 258–265. [Google Scholar] [CrossRef] [PubMed]
- Sardana, S.; Madan, A.K. Relationship of Wiener’s index and adjacent eccentric distance sum index with nitroxide free radicals and their precursors as modifiers against oxidative damage. J. Mol. Struct. THEOCHEM 2003, 624, 53–59. [Google Scholar] [CrossRef]
- Ghorbani, M.; Hosseinzade, M.A. A new version of Zagreb indices. Filomat 2012, 26, 93–100. [Google Scholar] [CrossRef]
- Das, K.C.; Lee, D.W.; Graovac, A. Some properties of the Zagreb eccentricity indices. ARS Math. Contemp. 2013, 6, 117–125. [Google Scholar]
- De, N. New Bounds for Zagreb Eccentricity Indices. Sci. Res. 2013, 3, 70–74. [Google Scholar] [CrossRef]
- Luo, Z.; Wu, J. Zagreb eccentricity indices of the generalized hierarchical product graphs and their applications. J. Appl. Math. 2014, 2014, 241712. [Google Scholar] [CrossRef]
- Farahani, M. Exact Formulas for the First Zagreb Eccentricity Index of Polycyclic Aromatic Hydrocarbons (PAHs). J. Appl. Phys. Sci. Int. 2015, 4, 185–190. [Google Scholar]
- Gutman, I. Distance of thorny graphs. Publ. Inst. Math., Nouv. Sér. 1998, 63, 31–36. [Google Scholar]
- De, N. On eccentric connectivity index and polynomial of thorn graph. Appl. Math. 2012, 3, 931–934. [Google Scholar] [CrossRef]
- De, N. Augmented eccentric connectivity index of some thorn graphs. Int. J. Appl. Math. 2012, 1, 4. [Google Scholar] [CrossRef]
- Hernández, J.; Rodríguez, J.; Sigarreta, J. On the geometric–arithmetic index by decompositions-CMMSE. J. Math. Chem. 2016, 1–16. [Google Scholar] [CrossRef]
- Rodrıguez, J.; Sigarreta, J. Spectral study of the geometric-arithmetic index. MATCH Commun. Math. Comput. 2015, 74, 121–135. [Google Scholar]
© 2017 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 (http://creativecommons.org/licenses/by/4.0/).