On global offensive alliance in zero-divisor graphs
Abstract
Let (V,E) be a simple graph without loops nor multiple edges. A nonempty subset S ⊂eq V is said a global offensive alliance if every vertex v ∈ V- S satisfies that S(v) ≥ S(v)+1. The global offensive alliance number o() is defined as the minimum cardinality among all global offensive alliances. Let R 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 (R).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.