Partial Domination in Graphs

Benjamin M. Case, Stephen T. Hedetniemi, Renu C. Laskar +1

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V-S$ is adjacent to at least one vertex in $S$. The domination number $\gamma (G)$ of $G$ equals the minimum cardina…