Partitioning zero-divisor graphs of finite commutative rings into global defensive alliances
Abstract
For a commutative ring R with identity, the zero-divisor graph of R, denoted (R), is the graph whose vertices are the non-zero zero divisors of R with two distinct vertices x and y are adjacent if and only if xy=0. In this paper, we are interested in partitioning the vertex set of (R) into global defensive alliances for a finite commutative ring R. This problem has been well investigated in graph theory. Here we connected it with the ring theoretical context. We characterize various commutative finite rings for which the zero divisor graph is partitionable into global defensive alliances. We also give several examples to illustrate the scopes and limits of our results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.