Isolation partitions in graphs

Gang Zhang, Weiling Yang, Xian'an Jin

Let $G$ be a graph and $k\ge 3$ an integer. A subset $D\subseteq V(G)$ is a $k$-clique (resp., cycle) isolating set of $G$ if $G-N[D]$ contains no $k$-clique (resp., cycle). In…