On rings whose Beck graph is split
The first ever construction of a graph from a commutative ring \(R\) is the graph with vertex set \(R\) and two distinct \(x\) and \(y\) are adjacent if \(xy=0.\) This construction of a graph from a commutative ring by \textit{I. Beck} [J. Algebra 116, No. 1, 208--226 (1988; Zbl 0654.13001)], has given lot of scope for research in recent times. In fact this definition has been modified and studied as the zero-divisor graph of a commutative ring by several authors. A graph \((V,E)\) is said to be a split graph if \(V\) is the disjoint union of two sets \(K\) and \(S\) where \(K\) induces a complete subgraph and \(S\) is an independent set. In this paper, the authors continue the study on the Beck graph. More specifically, the authors of this paper characterize reduced rings whose Beck graph is split and obtain some partial characterizations in the case of general rings.
- Coloring of commutative rings
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Properties of rings with a finite number of zero divisors
- The zero-divisor graph of a commutative ring
- When is the comaximal graph split?
This page was built for publication: On rings whose Beck graph is split
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747559)
