English

On global offensive alliance in zero-divisor graphs

Combinatorics 2021-06-21 v1

Abstract

Let \G(V,E)\G(V,E) be a simple graph without loops nor multiple edges. A nonempty subset SVS \subseteq V is said a {\em global offensive alliance} if every vertex vVSv \in V- S satisfies that \dS(v)\dS(v)+1\d_S(v) \geq \d_{\overline{S}}(v)+1. The {\em global offensive alliance number} \go(Γ)\g^o(\Gamma) is defined as the minimum cardinality among all global offensive alliances. Let RR be a finite commutative ring with identity. In this paper, we initiate the study of the global offensive alliance number of the zero-divisor graph \G(R)\G(R).

Keywords

Cite

@article{arxiv.2106.09811,
  title  = {On global offensive alliance in zero-divisor graphs},
  author = {Raúl Juárez Morales and Gerardo Reyna Hernández and Omar Rosario Cayetano y Jesús Romero Valencia},
  journal= {arXiv preprint arXiv:2106.09811},
  year   = {2021}
}
R2 v1 2026-06-24T03:20:17.688Z