A defensive alliance in an undirected graph G=(V,E) is a non-empty set S⊆V such that every vertex v∈S has at least as many neighbours (including itself) in S as it has in V∖S. In this paper, we consider the notion of global ...