ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING
Keywords:
generalized zero-divisor graph, zero-divisor graph, complete graph, chromatic number, clique numberAbstract
Let R be a commutative ring with identity, and let Z(R) be the set of zero-divisors of R. The generalized zero-divisor graph of R is defined as the graph Γg(R) with the vertex set Z(R)∗ = Z(R) \ {0}, and two distinct vertices x and y are adjacent if and only if annR(x) + annR(y) is an essential ideal of R. It follows that each edge (path) of the zero-divisor graph Γ(R) is an edge (path) of Γg(R). It is proved that Γg(R) is connected with diameter at most three and with girth at most four, if Γg(R) contains a cycle. Furthermore, all rings with the same generalized zero-divisor and zero-divisor graphs are characterized. Among other results, we show that the generalized zero-divisor graph associated with an Artinian ring is weakly perfect, i.e., its vertex chromatic number equals its clique number.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 N. Jahanbakhsh Basharlou, M.J. Nikmehr, R. Nikandish

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

