  For any set $\mathcal{F}$ of graphs and any graph $G$, let
$\iota(G,\mathcal{F})$ denote the size of a smallest set $D$ of vertices of $G$
such that the graph obtained from $G$ by deleting the closed neighbourhood of
$D$ does not contain a copy of a graph in $\mathcal{F}$. Thus,
$\iota(G,\{K_1\})$ is the domination number of $G$. For any integer $k \geq 1$,
let $\mathcal{F}_{1,k}$ be the set of regular graphs of degree at least $k-1$,
let $\mathcal{F}_{2,k}$ be the set of graphs whose chromatic number is at least
$k$, and let $\mathcal{F}_{3,k}$ be the union of $\mathcal{F}_{1,k}$ and
$\mathcal{F}_{2,k}$. We prove that for each $i \in \{1, 2, 3\}$, if $G$ is a
connected $m$-edge graph that is not a $k$-clique, then $\iota(G,
\mathcal{F}_{i,k}) \leq \frac{m+1}{{k \choose 2} + 2}$. We also determine the
graphs for which the bound is attained. Among the consequences are a sharp
bound of Fenech, Kaemawichanurat and the present author on the $k$-clique
isolation number and a sharp bound on the cycle isolation number.
