On Global Offensive Alliance in Zero-Divisor Graphs
On Global Offensive Alliance in Zero-Divisor Graphs
Let Ī(V,E) be a simple connected graph with more than one vertex, without loops or multiple edges. A nonempty subset SāV is 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 ā¦