Graph-Theoretic Techniques for the Study of Structures or Networks in EngineeringView this Special Issue
Research Article | Open Access
Abdullah Ali H. Ahmadini, Ali N. A. Koam, Ali Ahmad, Martin Bača, Andrea Semaničová–Feňovčíková, "Computing Vertex-Based Eccentric Topological Descriptors of Zero-Divisor Graph Associated with Commutative Rings", Mathematical Problems in Engineering, vol. 2020, Article ID 2056902, 6 pages, 2020. https://doi.org/10.1155/2020/2056902
Computing Vertex-Based Eccentric Topological Descriptors of Zero-Divisor Graph Associated with Commutative Rings
The applications of finite commutative ring are useful substances in robotics and programmed geometric, communication theory, and cryptography. In this paper, we study the vertex-based eccentric topological indices of a zero-divisor graphs of commutative ring , where and are primes.
One of the most significant issues in science is to change over chemical structure into numerical molecular descriptors that are pertinent to the physical, chemical, or organic properties. Atomic structure is one of the essential ideas of science since properties and chemical and organic practices of atoms are controlled by it.
Molecular descriptors called topological indices are graph invariants that play a significant job in science, and engineering, since they can be connected with huge physicochemical properties of particles. We utilize topological descriptors during the time spent associating the chemical structures with different attributes, for example, boiling points and molar heats of formation. The computation of these topological descriptors for various chemical graphs is a very attractive direction for researchers. The chemical structure of a molecule is represented by molecular descriptors.
Atoms and atomic structures are frequently displayed by a molecular graph. An atomic structure is a graph in which vertices are atoms and edges are its atomic bonds. In this manner, a topological descriptor is a numeric amount related with a graph which portrays the topology of graph and its invariants. There are some significant classes of topological descriptors and related polynomials which can be seen [1–9].
2. Definitions and Notations
Let and be the set of vertices and edges of connected graph , respectively. The basic notations and definitions are taken from the book . Let be the degree of vertex and be the distance between two vertices and . In mathematics, eccentricity is defined as
In , Sharma et al. introduced “eccentric connectivity index,” and the general formula of eccentric connectivity index is defined as
The “eccentric connectivity polynomial” [19, 20], “augmented eccentric connectivity index” [21–23], “connective eccentric index” , “Ediz eccentric connectivity index,” and “reverse eccentric connectivity index” [24, 25] are defined in equations (5)–(8) and (9), respectively.where and . denotes the set of all vertices adjacent .
3. Results and Discussion
Beck  defined the zero-divisor graph as “for a commutative ring with identity and set of its all zero divisors ,” its zero-divisor graph is constructed as and , if . For further study of zero divisor, see [27–32].
Let denotes the zero-divisor graph of the commutative ring . It is defined as follows: for and , if and only if , . Let , then . The vertices of the set are the nonzero divisors of the commutative ring . Also, is a nonzero divisor. Therefore, the total number of nonzero divisors is . There are total vertices of the commutative ring . Hence, there are total number of zero divisors. This implies that the order of the zero-divisor graph is , i.e., .
From the definition, we partitioned the vertex set of the graph into the following four partitions corresponding to their degrees:
This implies that . Let denotes the degree of a vertex in and denotes the distance between the vertices of two sets and . It is easy to see that , , , , , , , and . In the next theorem, we determined .
Lemma 1. The eccentricity of the vertices of is 2 or 3.
Proof. From the definition of zero-divisor graph, the vertices of the partition set are adjacent with the vertices of partitions and , i.e., . Similarly, it is observed that and , for any . Now, and . Also, the distance between any two different vertices of the same set of partition is 2. This shows that the maximum distance of the vertices of the partitions and is 2; therefore, their eccentricity is 2, i.e., .
Since partitions and are at distance 1 with partitions and , respectively, and , it follows that or . This implies that . This shows that the eccentricity of the vertices of is 2 or 3. This completes the proof.
We summarize the above discussion in Table 1.
We determined the eccentric connectivity index of in the following theorem.
Theorem 1. The eccentric connectivity index of is
Proof. Using the values from Table 1, formula (2) implies thatWe arrive at the desired result.
By using Lemma 1 and Table 1 in equations (3) and (4), we obtain the total eccentricity index and the first eccentricity Zagreb index for in the following corollaries.
Corollary 1. The total eccentricity index of is given by
Corollary 2. The first eccentricity Zagreb index of is given by
Theorem 2. The eccentric connectivity polynomial of is
Theorem 3. The augmented eccentric connectivity index of is
Theorem 4. The connective eccentric index of the graph is
Theorem 5. The Ediz eccentric connectivity index of the graph is
The following theorem determines the reverse eccentric connectivity index of the graph .
Theorem 6. The reverse eccentric connectivity index of the graph is
No data were used to support this study.
Conflicts of Interest
The authors declare no conflicts of interest.
This work was supported by the Slovak Research and Development Agency under contract no. APVV-19-0153 and by VEGA 1/0233/18.
- A. Ahmad, “On the degree based topological indices of benzene ring embedded in p-type-surface in 2D network,” Hacettepe Journal of Mathematics and Statistics, vol. 47, no. 1, pp. 9–18, 2018.
- M. Bača, J. Horváthová, M. Mokrišová, and A. Suhányiová, “On topological indices of fullerenes,” Applied Mathematics and Computation, vol. 251, pp. 154–161, 2015.
- M. Javaid, J.-B. Liu, M. A. Rehman, and S. Wang, “On the certain topological indices of titania nanotube TiO2 [m, n],” Zeitschrift für Naturforschung A, vol. 72, no. 7, pp. 647–654, 2017.
- A. Gravovac, M. Ghorbani, and M. A. Hosseinzadeh, “Computing fifth geometric-arithmetic index of nanostar dendrimers, Optoelectron,” Advanced Materials-Rapid Communications, vol. 4, no. 9, pp. 1419–1422, 2010.
- S. Hayat and M. Imran, “Computation of topological indices of certain networks,” Applied Mathematics and Computation, vol. 240, pp. 213–228, 2014.
- J.-B. Liu, S. Javed, M. Javaid, and K. Shabbir, “Computing first general Zagreb index of operations on graphs,” IEEE Access, vol. 7, pp. 47494–47502, 2019.
- M. F. Nadeem, S. Zafar, and Z. Zahid, “On certain topological indices of the line graph of subdivision graphs,” Applied Mathematics and Computation, vol. 271, pp. 790–794, 2015.
- M. F. Nadeem, S. Zafar, and Z. Zahid, “On topological properties of the line graphs of subdivision graphs of certain nanostructures,” Applied Mathematics and Computation, vol. 273, pp. 125–130, 2016.
- J.-B. Liu, M. Javaid, and H. M. Awais, “Computing Zagreb indices of the subdivision-related generalized operations of graphs,” IEEE Access, vol. 7, pp. 105479–105488, 2019.
- K. H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill Education, New York City, NY, USA, Seventh edition, 2012.
- V. Sharma, R. Goswami, and A. K. Madan, “Eccentric connectivity index: a novel highly discriminating topological descriptor for structure-property and structure-activity studies,” Journal of Chemical Information and Computer Sciences, vol. 37, no. 2, pp. 273–282, 1997.
- H. Dureja and A. K. Madan, “Topochemical models for prediction of cyclin-dependent kinase 2 inhibitory activity of indole-2-ones,” Journal of Molecular Modeling, vol. 11, no. 6, pp. 525–531, 2005.
- A. Ilic and I. Gutman, “Eccentric-connectivity index of chemical trees,” MATCH Communications in Mathematical and in Computer, vol. 65, pp. 731–744, 2011.
- V. Kumar and A. K. Madan, “Application of graph theory: prediction of cytosolic phospholipase A2 inhibitory activity of propan-2-ones,” Journal of Mathematical Chemistry, vol. 39, no. 3-4, pp. 511–521, 2006.
- B. Zhou, “On eccentric-connectivity index,” MATCH Communications in Mathematical and in Computer, vol. 63, pp. 181–198, 2010.
- R. Farooq and M. A. Malik, “On some eccentricity based topological indices of nanostar dendrimers,” Optoelectronics and Advanced Materials-Rapid Communications, vol. 9, no. 5-6, pp. 842–849, 2015.
- M. Ghorbani and M. Hosseinzadeh, “A new version of Zagreb indices,” Filomat, vol. 26, no. 1, pp. 93–100, 2012.
- X. Li and H. Zhao, “Trees with the first three smallest and largest generalized topological indices,” MATCH Communications in Mathematical and in Computer, vol. 50, pp. 57–62, 2004.
- M. Alaeiyan, J. Asadpour, and R. Mojarad, “A numerical method for MEC polynomial and MEC index of one-pentagonal carbon nanocones,” Fullerenes, Nanotubes and Carbon Nanostructures, vol. 21, no. 10, pp. 825–835, 2013.
- A. R. Ashrafi, M. Ghorbani, and M. A. Hossein-Zadeh, “The eccentric-connectivity polynomial of some graph operations,” Serdica Journal of Computing, vol. 5, pp. 101–116, 2011.
- A. Ali, Z. Raza, and A. A. Bhatti, “On the augmented Zagreb index,” Kuwait Journal of Science, vol. 43, no. 2, pp. 123–138, 2016.
- A. Ali, A. A. Bhatti, and Z. Raza, “The augmented Zagreb index, vertex connectivity, and matching number of graphs,” Bulletin of the Iranian Mathematical Society, vol. 42, no. 2, pp. 417–425, 2016.
- S. Gupta, M. Singh, and A. K. Madan, “Connective eccentricity index: a novel topological descriptor for predicting biological activity,” Journal of Molecular Graphics and Modelling, vol. 18, no. 1, pp. 18–25, 2000.
- S. Ediz, “On the ediz eccentric connectivity index of a graph,” Optoelectronics and Advanced Materials-Rapid Communications, vol. 5, no. 11, pp. 1263-1264, 2011.
- S. Ediz, “Reverse eccentric connectivity index,” Optoelectronics and Advanced Materials-Rapid Communications, vol. 6, no. 5-6, pp. 664–667, 2012.
- I. Beck, “Coloring of commutative rings,” Journal of Algebra, vol. 116, no. 1, pp. 208–226, 1988.
- D. F. Anderson and A. Badawi, “On the zero-divisor graph of a ring,” Communications in Algebra, vol. 36, no. 8, pp. 3073–3092, 2008.
- S. Akbari and A. Mohammadian, “On the zero-divisor graph of a commutative ring,” Journal of Algebra, vol. 274, no. 2, pp. 847–855, 2004.
- D. F. Anderson and S. B. Mulay, “On the diameter and girth of a zero-divisor graph,” Journal of Pure and Applied Algebra, vol. 210, no. 2, pp. 543–550, 2008.
- T. Asir and T. T. Chelvam, “On the total graph and its complement of a commutative ring,” Communications in Algebra, vol. 41, no. 10, pp. 3820–3835, 2013.
- K. Samei, “The zero-divisor graph of a reduced ring,” Journal of Pure and Applied Algebra, vol. 209, no. 3, pp. 813–821, 2007.
- T. T. Chelvam and T. Asir, “A note on total graph of ℤn,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 14, no. 1, pp. 1–7, 2011.
Copyright © 2020 Abdullah Ali H. Ahmadini et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.