Recovering rings from zero-divisor graphs
For a commutative ring \(R\) with \(1\), the zero-divisor graph of \(R\), denoted \(\Gamma(R)\), is the simple graph with vertex set equal to the nonzero zero-divisors of \(R\) and with distinct vertices \(x\) and \(y\) adjacent if and only if \(xy = 0\).NEWLINENEWLINEIn the paper under review the author shows that given a zero-divisor graph \(G\) with four or more vertices, one can find a ring \(R\cong R_1\times R_2\times\cdots\times R_n\), where each \(R_i\) is local such that the zero divisor graph of \(R\) is \(G\) and such that this representation is unique up to factors \(R_i\) of the same zero-divisor class. Furthermore, corollaries to this result prove that when the zero-divisor graphs have four or more vertices, local rings and non-local rings cannot have isomorphic zero-divisor graphs.
- On the Zero-Divisor Graph of a Ring
- On zero divisor graphs of the rings \(Z_n\)
- Zero-divisor graphs in commutative rings
- THE ZERO-DIVISOR GRAPHS OF RINGS AND SEMIRINGS
- scientific article; zbMATH DE number 7532060
- On zero-divisor graphs of finite rings.
- scientific article; zbMATH DE number 5778149
- On zero-divisor graphs of Boolean rings
- An ideal-based extended zero-divisor graph on rings
- Zero-divisor graphs of Ore extensions over reversible rings
- Corrigendum to ``On zero-divisor graphs of small finite commutative rings: [Discrete Math. 307 (2007) 1155-1166]
- Cut vertices and degree one vertices of zero-divisor graphs
- Cut vertices in zero-divisor graphs of finite commutative rings
- Cut-sets in zero-divisor graphs of finite commutative rings
- On zero-divisor graphs of small finite commutative rings
- The zero-divisor graph of a commutative ring
- Zero-divisor labelings of graphs
- Locating sets and numbers of graphs associated to commutative rings
- The zero-divisor graph of a commutative semigroup: a survey
- When zero-divisor graphs are divisor graphs
- The zero divisor graphs of commutative local rings of order \(p^4\) and \(p^5\)
- Finite Rings Whose Graphs Have Clique Number Less than Five
- A Note on the Uniqueness of Zero-Divisor Graphs with Loops (Research)
- On strong metric dimension of zero-divisor graphs of rings
- Induced subgraphs of zero-divisor graphs
This page was built for publication: Recovering rings from zero-divisor graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847692)