Portal de Periódicos da CAPES

Coloring of the annihilator graph of a commutative ring

2015; World Scientific; Volume: 15; Issue: 07 Linguagem: Inglês

10.1142/s0219498816501243

1793-6829

R. Nikandish, M. J. Nikmehr, M. Bakhtyiari,

Algebraic structures and combinatorial models

Let [Formula: see text] be a commutative ring with identity, and let [Formula: see text] be the set of zero-divisors of [Formula: see text]. The annihilator graph of [Formula: see text] is defined as the graph AG[Formula: see text] with the vertex set [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if ann[Formula: see text]. In this paper, we study annihilator graphs of rings with equal clique number and chromatic number. For some classes of rings, we give an explicit formula for the clique number of annihilator graphs. Among other results, bipartite annihilator graphs of rings are characterized. Furthermore, some results on annihilator graphs with finite clique number are given.