Partial domination - the isolation number of a graph

Yair Caro, Adriana Hansberg

We prove the following result: If $G$ be a connected graph on $n\ge 6$ vertices, then there exists a set of vertices $D$ with $|D|\le \frac{n}{3}$ and such that $V(G) \setminus N…