Partitioning a graph into defensive k-alliances

Ismael G. Yero, Sergio Bermudo, Juan A. Rodriguez-Velazquez +1

A defensive $k$-alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at least $k$ more neighbors in $S$ than it has outside of $S$. A defensi…