Global offensive k-alliance in bipartite graphs
Mustapha Chellali, Lutz Volkmann · Opuscula Mathematica · 2012
is the minimum cardinality of a global offensive k-alliance in G.We show that for every bipartite graph G and every integeris the set of vertices of degree at most k -1.Moreover, extremal trees attaining this upper bound are characterized.