Partial Domination in Prisms of Graphs

L. Philo Nithya, Joseph Varghese Kureethara

For any graph G = (V, E) and proportion $p\in (0,1]$, a set $S\subseteq V$ is a p-dominating set if $\frac{|N[S]|}{|V|}\ge p$. The $p$-domination number ${\gamma }_p(G)$ equals the minim…