On global offensive alliance in zero-divisor graphs
Combinatorics
2021-06-21 v1
Abstract
Let be a simple graph without loops nor multiple edges. A nonempty subset is said a {\em global offensive alliance} if every vertex satisfies that . The {\em global offensive alliance number} is defined as the minimum cardinality among all global offensive alliances. Let 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 .
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}
}