Complemented zero-divisor graphs and Boolean rings (Q2459985): Difference between revisions

Let \(R\) be a commutative ring with identity. The zero-divisor graph of \(R\), denoted by \(\Gamma(R)\), has as vertices the nonzero zero-divisors of \(R\), and two distinct vertices \(x\) and \(y\) are adjacent if and only if \(xy=0\). It is known that \(\Gamma(R)\) is connected with \(\text{diam}\Gamma(R)\leq 3\) and \(\text{girth}\Gamma(R)\leq 4\) (if \(\Gamma(R)\) contains a cycle) [see \textit{D. F. Anderson} and \textit{P. S. Livingston}, J. Algebra 217, No. 2, 434--447 (1999; Zbl 0941.05062)]. In the paper under review, the author classifies the zero-divisor graphs of Boolean rings, as well as those of Boolean rings that are rationally complete. It is also provide a complete list of those rings whose zero-divisor graphs have the property that every vertex is either an end or adjacent to an end.