TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Domination of zero-divisor graphs

* , , ,

* Corresponding author · click or hover a name for details

pp. 439–449Vol. 28Issue 2March 2025DOI: 10.47974/JDMSC-2060 Crossmark XML
Received:
15 May 2024
Published Online:
21 Mar 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2060
Pages:
439–449

Abstract

The graph that has vertices as elements in a commutative ring R, such that u and v are adjacent only if uv = 0, is called the zero-divisor graph, Π(R). We study the domination of Π(Zn) for all parts of n in this study, since Zn is one of the well-known rings.

Keywords

Subject Classifications

05C2505C6920F65

References

[1] M. N. Al-Harere, A. A. Omran, and A. T. Breesam, “Captive domination in graphs,” Discrete Mathematics, Algorithms and Applications, vol. 12, no. 6 (2020).
[2] H. Al-Janabi and G. Bacsó, “Integral-root Polynomials and Chromatic Uniqueness of Graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 4, pp. 1127–1147 (2021).
[3] H. Al-Janabi and G. Bacsó, “Chromatic Uniqueness of Zero-Divisor Graphs,” The Art of Discrete and Applied Mathematics, vol. 6, no. 1 (2022).
[4] Z. Y. Alrikabi and A. A. Omran, “Examining Captive and Inverse Captive Domination in Selected Graphs and Their Complements,” Math Model Eng Probl., vol. 10, no. 5 (2023).
[5] Z. Y. Alrikabi and A. A. Omran, “Restrained Captive Domination Number,” Open Engineering, vol. 14 (2024).
[6] D. F. Anderson and P. S. Livingston, “The Zero-Divisor Graph of a Commutative Ring,” Journal Algebra, vol. 217, no. 2, pp. 434–447 (1999).
[7] I. Beck, “Coloring of Commutative Rings,” Journal Algebra, vol. 116, no. 1, pp. 208–226 (1988).
[8] C. Berge, The Theory of Graphs and Its Applications, Methuen and Co. Ltd., London (1962).
[9] E. J. Cockayne and S. T. Hedetniemi, “Towards a Theory of Domination in Graphs,” Networks, pp. 247–261, vol. 7 (1977).
[10] R. Diestel, Graph Theory, 5th ed. Springer-Verlag (2017).
[11] F. M. Dong, K. M. Koh, and K. L. Teo, Chromatic Polynomial and Chromaticity of Graphs, World Scientific Publishing Co. Pte. Ltd., Singapore (2005).
[12] A. J. Hildebrand, Elementary Number Theory, Definitions and Theorems (Class Notes), University of Illinois at Urbana-Champaign (2011).
[13] S. H. Jafari and N. J. Jafari Rad, “On Domination of Zero-Divisor Graphs of Matrix Rings,” Canadian Mathematical Bulletin, vol. 58, no. 2, pp. 271–275 (2015). http://dx.doi.org/10.4153/CMB-2015-017-6.
[14] K. M. Koh, F. Dong, K. L. Ng, and E. G. Tay, Graph Theory Undergraduate Mathematics (2015).
[15] K. R. Kumar and J. Mathew, “Hyperstar Decomposition of r-Partite Complete, Knodel and Fibonacci Hypergraphs,” Journal of Physics: Conference Series, vol. 1850, p. 012-018 (2021).
[16] S. B. Mulay, “Cycles and Symmetries of Zero-Divisors,” Communications in Algebra, vol. 30, no. 7, pp. 3533–3558 (2002).
[17] N. J. Rad, S. H. Jafari, and D. A. Mojdeh, “On Domination in Zero-Divisor Graphs,” Canadian Mathematical Bulletin, vol. 56, no. 2, pp. 407–411 (2013).
[18] S. Shipiya Raj Shree, V. Maheswari, and R. Rajeswari, “Total and Cototal Domination Number of Some Zero Divisor Graph,” International Journal of Recent Technology and Engineering (IJRTE), vol. 8, no. 3S2 (2019).
[19] S. Ahmad, H. M. A. Siddiqui, A. Ali, M. R. Farahani, M. Imran, and I. N. Cangul, “On Wiener Index and Wiener Polarity Index of Some Polyomino Chains,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 7, pp. 1151–1164 (2019). [Online]. Available: https://doi.org/10.1080/09720529.2019.1688965.
[20] M. Alaeiyan, F. Afzal, M. R. Farahani, and M. A. Rostami, “An Exact Formula for the Wiener Polarity Index of Nanostar Dendrimers,” Journal of Information and Optimization Sciences, vol. 41, no. 4, pp. 933–939 (2020). [Online]. Available: https://doi.org/10.1080/02522667.2020.1748274.
[21] S. Ediz, İ. Çiftçi, M. Cancan, and M. R. Farahani, “On k-Total Distance Degrees and k-Total Wiener Polarity Index,” Journal of Information and Optimization Sciences, vol. 42, no. 7, pp. 1469–1477 (2021). [Online]. Available: https://doi.org/10.1080/02522667.2021.1896652.
[22] W. Gao and M. R. Farahani, “The Hyper-Zagreb Index for an Infinite Family of Nanostar Dendrimers,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 20, no. 2, pp. 515–523 (2017). [Online]. Available: https://doi.org/10.1080/09720529.2016.1220088.
[23] M. Nadeem, S. Ahmad, M. K. Siddiqui, M. A. Ali, M. R. Farahani, and A. J. M. Khalaf, “On Some Applications Related with Algebraic Structures Through Different Well-Known Graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 2, pp. 451–471 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2021.1885806.
[24] A. H. Alwan, “Small Intersection Graph of Subsemimodules of a Semimodule,” Communications in Combinatorics, Cryptography & Computer Science, vol. 2022, no. 1, pp. 15–22 (2022).
[25] S. Ediz, M. Cancan, and M. R. Farahani, “Eccentric Connectivity and Connective Eccentricity Indices of Generalized Petersen Graphs,” Communications in Combinatorics, Cryptography & Computer Science, vol. 2021, no. 1, pp. 1–6 (2021).
[26] R. Ponraj, S. Prabhu, and M. Sivakumar, “Pair Mean Cordial Labeling of Total Graph of Some Graphs and Prism Related Graphs,” Communications in Combinatorics, Cryptography & Computer Science, vol. 2024, no. 2, pp. 181–192 (2024).
[27] F. O. Oduol and I. O. Okoth, “Counting Vertices Among All Non-Crossing Trees by Levels and Degrees,” Communications in Combinatorics, Cryptography & Computer Science, vol. 2024, no. 2, pp. 193–212 (2024).

Views: 262Downloads: 76Citations: 0