Coloring in essential annihilating-ideal graphs of commutative rings
Combinatorics
2022-08-09 v1
Abstract
The essential annihilating-ideal graph of a commutative unital ring is a simple graph whose vertices are non-zero ideals of with non-zero annihilator and there exists an edge between two distinct vertices if and only if has a non-zero intersection with any non-zero ideal of . In this paper, we show that is weakly perfect, if is Noetherian and an explicit formula for the clique number of is given. Moreover, the structures of all rings whose essential annihilating-ideal graphs have chromatic number are fully determined. Among other results, twin-free clique number and edge chromatic number of 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}
}