English

Coloring in essential annihilating-ideal graphs of commutative rings

Combinatorics 2022-08-09 v1

Abstract

The essential annihilating-ideal graph EG(R)\mathcal{EG}(R) of a commutative unital ring RR is a simple graph whose vertices are non-zero ideals of RR with non-zero annihilator and there exists an edge between two distinct vertices I,JI,J if and only if Ann(IJ)Ann(IJ) has a non-zero intersection with any non-zero ideal of RR. In this paper, we show that EG(R)\mathcal{EG}(R) is weakly perfect, if RR is Noetherian and an explicit formula for the clique number of EG(R)\mathcal{EG}(R) is given. Moreover, the structures of all rings whose essential annihilating-ideal graphs have chromatic number 22 are fully determined. Among other results, twin-free clique number and edge chromatic number of EG(R)\mathcal{EG}(R) are examined.

Keywords

Cite

@article{arxiv.2208.03751,
  title  = {Coloring in essential annihilating-ideal graphs of commutative rings},
  author = {R. Nikandish and M. Mehrara and M. J. Nikmehr},
  journal= {arXiv preprint arXiv:2208.03751},
  year   = {2022}
}