Abstract
This article is devoted to the determination of edge-based eccentric topological indices of a zero divisor graph of some algebraic structures. In particular, we computed the first Zagreb eccentricity index, third Zagreb eccentricity index, geometric-arithmetic eccentricity index, atom-bond connectivity eccentricity index and a fourth type of eccentric harmonic index for zero divisor graphs associated with a class of finite commutative rings.
MSC:
05C12; 05C10; 05C90
1. Introduction
Algebraic structures have been studied for their close affiliation with representation theory and number theory, and they have been extensively studied in combinatorics [1,2]. In addition to the extensive theoretical research in these areas, finite rings and fields have received attention for their applications to cryptography and coding theory.
A foundational role of molecular descriptors is to consider molecules as real bodies and transform them into numbers, which enables mathematics to play a key role in chemistry, pharmaceutical sciences, environmental protection, quality control and health research. These molecular descriptors are graph invariants and are usually known as topological indices. In graph theory, by using topological indices we correlate various characteristics of a chemical structure in order to characterize it. These days there is an area of research devoted to computing topological indices for various structures.
In mathematical chemistry, a molecular or chemical graph is a presentation of the structural formula of a chemical compound in the form of graph structures. A chemical graph is a labeled graph with corresponding vertices representing the atoms of the compound and edges representing their chemical bonds. A topological index associated with a chemical graph is a numeric value which remains invariant under the graph automorphism and it also characterizes the topology of a chemical graph. Hence, these indices have a variety of applications in chemistry as well as in pharmaceutical science and in the structures of nanotubes [3,4]. For graph theory, topological indices are classified as “topological indices based on degrees” [5,6,7,8], “topological indices based on distances” and “topological indices based on eccentricities” of graphs. Some well-known topological indices based on the degrees of a graph are the Randi connectivity index, Zagreb indices, Harmonic index, atom bond connectivity, geometric arithmetic index and so forth, and the Wiener index, Hosaya index and Estrada index are distance based topological indices [9,10]. Similarly, eccentricity based topological indices include the Zagreb eccentricity index [11,12], geometric-arithmetic eccentricity index [13], connectivity of atomic bond eccentricity index [14] and the fourth type of eccentric harmonic index [15,16]. Topological indices lay the criteria for the growth of chemical structures and how mathematical operations on the graphs, with the relief of topological indices, can extend multidisciplinary research.
2. Motivation behind Topological Indices
An association between the stability of linear alkanes and the branched alkanes is studied through the index. This index is also used for the computation of strain energy for cyclo alkanes [17,18]. In order to correlate certain physico-chemical characteristics, the GA index has more efficient predictive power than does the Randic connectivity index [19,20]. The Zagreb indices (first and second) are powerful tools for the computation of total p-electron energy of the molecules within a particular approximate expression [21]. The topological indices that are based on degrees are more useful for examining the chemical characteristics of distinct molecular structures. These applications provide a motivation to study topological indices that are eccentricity based. The topological indices based on eccentricity are useful for the assessment of the toxicological, physico-chemical and pharmacological characteristics of a compound through the structure of its molecules. The study of the QSAR (quantitative structure activity relationship) is known for this sort of analysis [22]. In order to obtain further details on the applications of Topological indices see References [23,24].
3. Methods
In order to obtain our intended outcomes we used combinatorial tools such as vertex partition, edge partition, eccentricity, eccentricity counting for each degree and other graph theoretical methods with some analytic techniques [23,25]. Moreover, we use for the verification of degree and their corresponding eccentricity.
4. Definitions and Notations
Let G be a connected graph with vertex set and edge set . We associate with each graph G a numerical value, called the topological index (descriptor). This index remains invariant under graph automorphisms. The number of edges adjacent to a vertex v is called the degree of v which is denoted by and the corresponding maximum and minimum degree of a vertex in a graph G is denoted by and respectively. The denotes the distance between any two vertices u and v which is defined as the number of edges in the shortest path between the vertices u and v. The eccentricity of a vertex v in a graph G is defined as:
We study general topological invariant based on the eccentricity of vertices in graph G.
where is a real function of and .
- If , where is a real number, then is the first Zagreb eccentricity index if [11,12].
- If , where is a real number, then is the third Zagreb eccentricity index if [11,12].
- If , we obtain the geometric-arithmetic eccentricity index [13].
- If , we obtain the atom-bond connectivity eccentricity index [14].
- If , we obtain the fourth type of eccentric harmonic index [15,16].
A commutative ring R with identity a non-zero element is called a zero divisor if there exists another non zero element such that in The set of all zero divisors in R is denoted by By considering a finite commutative ring R, we associate a zero divisor graph such that if and if and only if The notion of the zero divisor graph was introduced by Beck [2] and later for any commutative ring R, Anderson and Livingston, in Reference [26], proved that the zero divisor graph is a connected graph. Due to broad interest in parameters associated with graphs and rings, several authors investigated the associated identities of zero-divisor for commutative rings, see for example References [23,27,28].
5. Main Results
For positive integers , we consider to be a zero divisor graph of commutative ring whose vertex set is and edge set is Then
and
This section is devoted on the discussion of eccentric topological indices based on the edges of zero divisor graphs for rings with and , where and q are prime numbers.
5.1. Case 1:
Let be a zero divisor graph of commutative ring , where are prime numbers with , in this subsection we discuss the eccentric topological indices for .
Theorem 1.
Let be the zero divisor graph of commutative ring , where are prime numbers with Then and .
Proof.
Let . Then we have following cases:
- If and for any with then each of this type is connected to the vertices of type . Hence the degree of each such vertex is Similarly if and , then the degree of each such vertex is
- If and then each such vertex is connected to the vertices of types and for every , , and with Hence the degree of each such vertex is
- If and then each such vertex is connected to the vertices of type and for every , , and Therefore the degree of each such vertex is Similarly if and then the degree of each such vertices is
- If and then each such vertex is connected to vertex for every . Hence the degree of each such vertex is Similarly if and then the degree of each such vertex is
- If and then each such vertex is connected to the vertices of type and for every . Therefore the degree of each such vertex is Similarly, if and then the degree of each such vertex is
- If and , and then each such vertex is connected to the vertex for every . Hence the degree of each such vertex is
The total number of vertices of from the above cases is:
Hence,
The total number of edges of is obtained by using hand shaking lemma as:
After simplification we get, . □
From the proof of Theorem 1 and our convenance, we partition the vertex set of as follows:
This shows that . It is observed that , , , , , , , and Let the degree of a vertex u in set A be denoted by and the distance between two vertices sets X and Y be Then following theorem determines the eccentricity of the vertices in graph .
Theorem 2.
If and q are prime numbers such that and the associated zero divisor graph to the commutative ring then the eccentricity of the vertices of corresponding graph is either 2 or 3.
Proof.
It is easy to see from the proof of Theorem 1 that,
Hence the eccentricity of the corresponding vertices of set is 3 i.e., . Similarly, we can see that for and Therefore, .
As and for This shows . Similarly, it is easy to calculate for and This implies . □
Lemma 1.
For any three prime numbers and q such that and the associated zero divisor graph of commutative ring we have,
Proof.
The graph contains vertices and edges. Let us divide the edges of into partition sets according to the eccentricity of its end vertices.
This means that the set contains the edges incident with one vertex of eccentricity r and the other vertex of eccentricity s. From the Theorem 1 and Theorem 2, we have , , and . Then
□
Now we present values of the eccentric topological indices of the graph which are edge-based.
Theorem 3.
If and q are prime numbers such that and the associated zero divisor graph to the commutative ring then
the First Zagreb eccentricity index of is:
the third Zagreb eccentricity index is:
the geometric-arithmetic eccentricity index is:
the atom-bond connectivity eccentricity index is:
the fourth type of eccentric harmonic index is:
Proof.
For the first Zagreb eccentricity index of we obtain . So , and Thus by Lemma 1,
For the third Zagreb eccentricity index of we obtain . So and So by Lemma 1,
For the geometric-arithmetic eccentricity index of , we get . So and Therefore,
For the atom-bond connectivity eccentricity index of , we obtain . Thus and Therefore,
For the fourth type of eccentric harmonic index of , we get , therefore and Thus,
□
5.2. Case 2:
In this subsection, we discuss the eccentric topological indices for zero divisor graph defined on commutative ring where are prime numbers.
Theorem 4.
Let p and q be prime numbers and be the zero divisor graph of commutative ring . Then and .
Proof.
For any two prime numbers p and we consider the ring with usual operations. The associated zero divisor graph on ring R is defined as: Any if and only if the elements or with Therefore, a non zero element is not a zero divisor in the ring R if and only if u is not a multiple of p and v is not a multiple of As the number of elements in which are not a multiple of p are and the number of elements in which are not a multiple of q are Also, the element is not a zero divisor in Thus the total number of non zero divisors in the ring R is This implies
For any we discuss the degree of each vertex as follows:
- If and v is not a multiple of q, then vertex of this form is connected to each vertex where Hence each vertex has degree By symmetry each vertex such that u is not a multiple of p has degree
- If and , then vertex of this form is connected to each vertex where and with Hence the each vertex of this type has degree By symmetry the degree of each vertex such that is
- If u is not a multiple of p and , then each vertex is connected to each vertex Hence each vertex of this type has degree By symmetry the degree of each vertex if and v is not a multiple of q is
- If and , then each vertex of this form is connected to each vertex where and with Hence the degree of each vertex is
From the above discussion, it is easy to see that the zero divisor graph contains vertices of degree , vertices of degree , vertices of degree , vertices of degree , vertices of degree , vertices of degree and vertices of degree . By using the hand shaking lemma the number of edges of are □
Let denotes the set of containing the vertices of degree i. From the proof of Theorem 4, we get and . The following theorem determines the eccentricity of the vertices in graph of .
Theorem 5.
Let p and q be two prime numbers and be the zero divisor graph of commutative ring Then the eccentricity of a vertex of is either 2 or 3.
Proof.
Similar proof of Theorem 2, we get and . □
Lemma 2.
Let p and q be two prime numbers and be the zero divisor graph of commutative ring Then
Proof.
The graph contains vertices and edges. Let us divide the edges of into partition sets with respect to the degree of endpoints of each edge as:
This means that the set contains the edges incident with one vertex of eccentricity r and the other vertex of eccentricity s. From the Theorem 4 and Theorem 5, we get , , and . Then
□
Now we present values of eccentric topological indices based on edges of graph .
Theorem 6.
Let p and q be two prime numbers and be the zero divisor graph of commutative ring Then the First Zagreb eccentricity index of is:
the third Zagreb eccentricity index is:
the geometric-arithmetic eccentricity index is:
the atom-bond connectivity eccentricity index is:
the fourth type of eccentric harmonic index is:
Proof.
For the first Zagreb eccentricity index of we obtain . So , and Thus by Lemma 2,
For the third Zagreb eccentricity index of we obtain . So and So by Lemma 2,
For the geometric-arithmetic eccentricity index of , we get . So and Therefore,
For the atom-bond connectivity eccentricity index of , we obtain . Thus and Therefore,
For the fourth type of eccentric harmonic index of , we get , therefore and Thus,
□
6. Conclusions
This article emphasizes the computation of first Zagreb eccentricity index, third Zagreb eccentricity index, geometric-arithmetic eccentricity index, atom-bond connectivity eccentricity index and the fourth type of eccentric harmonic index for zero divisor graphs associated with algebraic structures that are commutative rings and . This study will be useful for the further comprehension of the attributes of various physical structures like carbohydrates, silicone structures, polymers, hexagonal chains and cylindrical fullerenes. Likewise, they can be used for creating a productive physical structure in mechanics as well as for different computer network problems.
Author Contributions
A.N.A.K. contribute for Conceptualization, Data curation, Funding acquisition, Project administration and Resources. A.A. contribute for Investigation, Methodology, Supervision, and Validation. A.H. contribute for Formal analysis, Project administration, and Visualization. All authors read and approved the initial and final version of the paper.
Funding
This research received no external funding.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Ahmad, A.; Haider, A. Computing the radio labeling associated with zero divisor graph of a commutative ring. UPB Sci. Bull. Ser. A 2019, 81, 65–72. [Google Scholar]
- Beck, I. Coloring of a commutative ring. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
- Bača, M.; Horvràthovà, J.; Mokrišovà, M.; Suhànyiovà, A. On topological indices of fullerenes. Appl. Math. Comput. 2015, 251, 154–161. [Google Scholar]
- Gutman, I.; Polansky, O.E. Mathematical Concepts in Organic Chemistry; Springer-Verlag: New York, NY, USA, 1986. [Google Scholar]
- Ahmad, A. On the degree based topological indices of benzene ring embedded in P-type-surface in 2D network. Hacet. J. Math. Stat. 2018, 47, 9–18. [Google Scholar] [CrossRef]
- Ahmad, A. Computation of certain topological properties of honeycomb networks and Graphene. Discret. Math. Algorithms Appl. (DMAA) 2017, 9, 1750064. [Google Scholar] [CrossRef]
- Akhter, S.; Gao, W.; Imran, M.; Farahani, M.R. On topological indices of honeycomb networks and graphene networks. Hacet. J. Math. Stat. 2018, 47, 19–35. [Google Scholar] [CrossRef]
- Nadeem, M.F.; Zafar, S.; Zahid, Z. On topological properties of the line graphs of subdivision graphs of certain nanostructures. Appl. Math. Comput. 2016, 273, 125–130. [Google Scholar] [CrossRef]
- Wang, S.; Farahani, M.R.; Kanna, M.R.R.; Jamil, M.K.; Kumar, R.P. The Wiener Index and the Hosoya Polynomial of the Jahangir Graphs. Appl. Comput. Math. 2016, 5, 138–141. [Google Scholar] [CrossRef]
- Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
- Ghorbani, M.; Hosseinzadeh, M.A. A new version of Zagreb indices. Filomat 2012, 26, 93–100. [Google Scholar] [CrossRef]
- Vukičević, D.; Graovac, A. Note on the comparison of the first and second normalized Zagreb eccentricity indices. Acta Chim. Slov. 2010, 57, 524–528. [Google Scholar] [PubMed]
- Ghorbani, M.; Khaki, A. A note on the fourth version of geometric-arithmetic index. Optoelectron. Adv. Mater. Rapid Commum. 2010, 4, 2212–2215. [Google Scholar]
- Farahani, M.R. Eccentricity version of atom bond connectivity index of benzenoid family ABC5(Hk). World Appl. Sci. J. Chem. 2013, 21, 1260–1265. [Google Scholar]
- Farahani, M.R.; Ediz, S.; Imran, M. On novel harmonic indices of certain nanotubes. Int. J. Adv. Biotechnol. Res. 2017, 8, 277–282. [Google Scholar]
- Gao, Y.; Ediz, S.; Farahani, M.R.; Imran, M. On the Second Harmonic Index of Titania Nanotubes. Drug Des. Int. Prop. Int. J. 2018, 1, 7–10. [Google Scholar]
- Estrada, E.; Torres, L.; Rodriguez, L.; Gutman, I. An atom-bond connectivity index: modelling the enthalpy of formation of alkanes. Indian J. Chem. 1998, 37A, 849–855. [Google Scholar]
- Siddiqui, M.K.; Naeem, M.; Rehman, N.A.; Imran, M. Computing topological indices of certain networks. J. Optoelectron. Adv. Mater. 2016, 18, 884–892. [Google Scholar]
- Shao, Z.; Wu, P.; Gao, Y.; Gutman, I.; Zhang, X. On the maximum ABC index of graphs without pendent vertices. Appl. Math. Comput. 2017, 315, 298–312. [Google Scholar] [CrossRef]
- Siddiqui, M.K.; Imran, M.; Ahmad, A. On Zagreb indices, Zagreb polynomials of some nanostar dendrimers. Appl. Math. Comput. 2016, 280, 132–139. [Google Scholar] [CrossRef]
- Shao, Z.; Siddiqui, M.K.; Muhammad, M.H. Computing zagreb indices and zagreb polynomials for symmetrical nanotubes. Symmetry 2018, 10, 244. [Google Scholar] [CrossRef]
- Gupta, S.; Singh, M.; Madan, A.K. Application of Graph Theory: Relationship of Eccentric Connectivity Index and Wiener’s Index with Anti-inflammatory Activity. J. Math. Anal. Appl. 2002, 266, 259–268. [Google Scholar] [CrossRef]
- Elahi, K.; Ahmad, A.; Hasni, R. Construction algorithm for zero divisor graphs of finite commutative rings and their vertex-based eccentric topological indices. Mathematics 2018, 6, 301. [Google Scholar] [CrossRef]
- Imran, M.; Siddiqui, M.K.; Abunamous, A.A.E.; Adi, D.; Rafique, S.H.; Baig, A.Q. Eccentricity based topological indices of an oxide network. Mathematics 2018, 6, 126. [Google Scholar] [CrossRef]
- Harris, J.M.; Hirst, J.L.; Mossinghoff, M.J. Combinatorics and Graph Theory; Springer Science and Business Media: Berlin, Germany, 2008. [Google Scholar]
- Anderson, D.F.; Livingston, P.S. The Zero-divisor Graph of Commutative Ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
- Akbari, S.; Mohammadian, A. On the zero-divisor graph of a commutative ring. J. Algebra 2004, 274, 847–855. [Google Scholar] [CrossRef]
- Anderson, D.F.; Mulay, S.B. On the diameter and girth of a zero-divisor graph. J. Pure Appl. Algebra 2008, 210, 543–550. [Google Scholar] [CrossRef]
© 2019 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/).