On $k$-limited domination: complexity and Sierpi\'nski graphs
A dominating set $D$ of a graph $G$ is called $k$-limited if every vertex of $D$ has at most $k$ neighbors outside $D$. The minimum cardinality among all $k$-limited dominating sets of $G$ is the $k$-limited domination number, denoted by $\gamma_k^L(G)$. In this paper, we prove that the $1$-Limited Dominating Set probl...