A Note on the Complexity of Defensive Domination

Steven Chaplick, Grzegorz Gutowski, Tomasz Krawczyk

In a graph G, a k-attack A is any set of at most k vertices and l-defense D is a set of at most l vertices. We say that defense D counters attack A if each a in A can be matched to…