On the $C_4$-isolation number of a graph

Xiaohua Wei, Gang Zhang, Biao Zhao

Let $C_k$ be the cycle of length $k$. For any graph $G$, a subset $D\subseteq V(G)$ is a $C_k$-isolating set of $G$ if the graph obtained from $G$ by deleting the closed neighbour…