Abstract
For a commutative ring \(R\), even elements in \(R\) as vertices and two distinct vertices \({x}_{i},{y}_{j}\in R\) are adjacent iff \({x}_{i}{y}_{j}=0\) or \({y}_{j}{x}_{i}=0\), then the graph is known as an even prime graph. In compressed even prime graph, whose vertex set is the set of all equivalence classes of even elements in \(R\), the equivalence classes elements are denoted by \([\beta ]\) or \(\overline{\beta }\) and two distinct equivalence classes \([{\beta }_{i}]\) and \([{\beta }_{j}]\) are adjacent iff \([{\beta }_{i}][{\beta }_{j}]=0\), graph is denoted by \(EP{G}_{E}({\mathbb{Z}}_{n})\). This paper delves into discussions regarding the chromatic number and clique number of such graphs across various families. Additionally, we discuss the chromatic number of the prime graph associated with the commutative ring \(R\).
Similar content being viewed by others
Data availability
No data was used for the research described in this paper.
References
Anderson, D.F., Livingston, P.S.: The zero divisor graph of a commutative ring. J. Algebra 217, 434–447 (1999)
Anderson, D.F., Mulay, S.B.: On the diameter and girth of a zero divisor graph. J. Pure Appl. Algebra 210, 543–550 (2007)
Ahmed, S.: Applications of graph coloring in modern computer science. Int. J. Comput. Inform. Technol. 3(2), 1–7 (2012)
Beck, I.: Coloring of commutative rings. J. Algebra 116, 208–226 (1988)
Bertram, E.A.: Some applications of graph theory to finite groups. Discret. Math.. Math. 44(1), 31–43 (1983)
Bhavanari, S., Kuncham, S., Dasari, N.: Prime graph of a ring. J. Combin. Inform. System Sci.Combin. Inform. System Sci. 35, 27–42 (2010)
Burness, T.C., Covato, E.: On the prime graph of simple groups. Bull. Aust. Math. Soc. 91, 227–240 (2015)
Chellali, M., Maffray, F.: Dominator colorings in some classes of graphs. Graphs Comb. 28, 97–107 (2012)
Chithra, K.P., Joseph, M.: Total domination coloring of graphs. J. Math. Comput. Sci.Comput. Sci. 11, 442–458 (2020)
Demange, M., Ekim, T., Ries, B., Tanasescu, C.: On some applications of the selective graph coloring problem. Eur. J. Oper. Res.Oper. Res. 240(2), 307–314 (2015)
Dorbidi, H.R.: A note on the coprime graph of a group. Int. J. Group Theory 5, 17–22 (2016)
Falcon, R.M., Falcon, O.J., Nunez, J.: An application of total colored graphs to describe mutations in non-mendelian genetics. Mathematics 7, 1068 (2019)
Furmanczyk, H., Kubale, M.: The complexity of equitable vertex coloring of graphs. J. Appl. Comput. Sci. 13, 95–106 (2005)
Garey, M., Johnson, D., So, H.: An application of graph coloring to printed circuit testing. IEEE Trans. Circuits Syst. 23(10), 591–599 (1976)
Kazemi, A.P.: Total dominator chromatic number of a graph. Trans. Com. 4, 57–68 (2015)
Liu, C., Zhu, E.: General vertex distinguishing total coloring of graphs. J. Appl. Math. 24, 398 (2014)
Lu, D., Wu, T.: The zero divisor graphs of posets and an application to semigroups. Graphs Comb. 26, 793–804 (2010)
Maffray, F., Silva, A.: Colouring outerplanar graphs with large girth. Discret. Math.. Math. 312, 1796–1803 (2012)
Maimani, H.R., Wickham, C., Yassemi, S.: Rings whose total graphs have genus at most one. Rocky Mt. J. Math. 42, 1551–1560 (2012)
Merouane, H.B., Haddad, M., Chellali, M., Kheddouci, H.: Dominated colorings of graphs. Graphs Comb. 3, 713–727 (2015)
Orden, D., Guzman, J.M., Maestre, I., Hoz, E.: Spectrum graph coloring and applications to Wi-Fi channel assignment. Symmetry 10(3), 65 (2018)
Patra, K., Kalita, S.: Prime graph of the commutative ring Zn. Malays. J. Ind. Appl. Math. (2014). https://doi.org/10.11113/matematika.v30.n.663
Rayer, C.J., Sankar, J.R.: Wiener index and graph energy of zero divisor graph for commutative rings. Asian-Eur. J. Math. 16(11), 2350211 (2023)
Redmond, S.P.: An ideal based zero divisor graph of a commutative ring. Comm. Algebra 31, 4425–4443 (2003)
Sarathy, R., Sankar, J.R.: Applications on color (distance) signless laplacian energy of annihilator monic prime graph of commutative rings. Ain Shams Eng. J. 15(3), 102469 (2024)
Sharma, P.K., Bhatwadekar, S.M.: A note on graphical representation of rings. J. Algebra 176, 124–127 (1995)
Singh, P., Bhat, V.K.: Graph invariants of the line graph of zero divisor graph of Zn. J. Appl. Math. Comput.Comput. 68(2), 1271–1287 (2022)
Sinha, D., Kaur, B.: Some aspects of zero-divisor graphs for the ring of Gaussian integers modulo 2n. J. Appl. Math. Comput.Comput. (2022). https://doi.org/10.1007/s12190-021-01518-9
Smith, N.O.: Infinite planar zero divisor graphs. Comm. Algebra 35, 171–180 (2006)
Thevenin, S., Zufferey, N., Potvin, J.Y.: Graph multi-coloring for a job scheduling application. Discret. Appl. Math.. Appl. Math. 234, 218–235 (2018)
Tosuni, B.: Graph coloring problems in modern computer science. Eur. J. Interdiscip. Stud. 1(2), 87–95 (2015)
Zhou, Y., Zhao, D., Ma, M., Xu, J.: Domination coloring of graphs. Mathematics 6, 998 (2022)
Funding
No funding were used to support this study.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest:
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Sarathy, R., Ravi Sankar, J. Coloring of graphs associated with commutative rings. J. Appl. Math. Comput. (2024). https://doi.org/10.1007/s12190-024-02055-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12190-024-02055-x