ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING

Authors

  • N. Jahanbakhsh Basharlou Islamic Azad University - Department of Mathematics
  • M.J. Nikmehr K.N. Toosi University of Technology - Faculty of Mathematics
  • R. Nikandish Jundi-Shapur University of Technology - Department of Basic Sciences

Keywords:

generalized zero-divisor graph, zero-divisor graph, complete graph, chromatic number, clique number

Abstract

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

2018-02-28

How to Cite

Basharlou, N. J., Nikmehr, M., & Nikandish, R. (2018). ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING. Italian Journal of Pure and Applied Mathematics, 39, 128–139. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/6948

Issue

Section

Articoli - Forum Editrice