Partial domination in supercubic graphs

Csilla Bujtás andMichael A. Henning, Sandi Klavžar

For some $\alpha$ with $0<\alpha \le 1$, a subset $X$ of vertices in a graph $G$ of order~$n$ is an $\alpha$-partial dominating set of $G$ if the set $X$ dominates at least $\alpha \times n$ vertices…