Characterizes zero-divisor graphs regarding vertex-decomposability, Cohen-Macaulayness, and well-coveredness in finite commutative rings.
Let R be a finite commutative ring with 1 ≠ 0. The zero-divisor graph of R is the graph obtained by letting all the nonzero zero-divisors of R to be the vertices and defining distinct vertices x and y to be adjacent if and only if xy = 0. In this paper, vertex-decomposability, Cohen–Macaulayness and well-coveredness of zero-divisor graphs are characterized.
No takes yet. Share an insight, caveat, or question.
Ashitha et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: