Global o Ensive Alliance Numbers in Graphs With Emphasis on Trees
For a graph G =(V,E), a non-empty set S ⊆ V is a global offensive alliance if for every v ∈ V -S, at least half of the vertices from the closed neighborhood of v are in S.A set S ⊆ V is a global strong offensive alliance if for each vertex v ∈ V - S, a strict majority of the vertices of the closed neighborhood of v are in S. The cardinality of a minimum global (strong) offensive alliance of a graph G is called the global (strong) offensive alliance number of G. We determine bounds on the global offensive alliance and the global strong offensive alliance numbers of a graph, and characterize the trees achieving two of these lower bounds.
Chellali, Mustapha; Haynes, Teresa W.; and Volkmann, Lutz. 2009. Global o Ensive Alliance Numbers in Graphs With Emphasis on Trees. Australasian Journal of Combinatorics. Vol.45 87-96. https://ajc.maths.uq.edu.au/pdf/45/ajc_v45_p087.pdf ISSN: 1034-4942