Parameterized Complexity of Locally Minimal Defensive Alliances

Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi

A set $S$ of vertices of a graph is a defensive alliance if, for each element of $S$, the majority of its neighbours is in $S$. We consider the notion of local minimality in this p…