Complexity results for $k$-domination and $\alpha$-domination problems and their variants

Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad

Let $G=(V,E)$ be a simple and undirected graph. For some integer $k\ge 1$, a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has…