Partitioning zero-divisor graphs of finite commutative rings into global defensive alliances

From MaRDI portal
Publication:6437474

arXiv2305.12942MaRDI QIDQ6437474FDOQ6437474


Authors: Driss Bennis, Brahim El Alaoui Edit this on Wikidata


Publication date: 22 May 2023

Abstract: For a commutative ring R with identity, the zero-divisor graph of R, denoted Gamma(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 Gamma(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.













This page was built for publication: Partitioning zero-divisor graphs of finite commutative rings into global defensive alliances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437474)