For any positive integer k and any n-vertex graph G, let ι(G,k) 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 contains no k-clique. Thus, ι(G,1) is the domination number of G. We prove ...
Isolation of k-cliques Discrete Math. (2020) BorgP. et al. Partial domination of maximal outerplanar graphs Discrete Appl. Math. (2020) GoddardW. et al. Independent domination in graphs: A survey and recent results Discrete Math. (2013) HenningM.A. A survey of selected recent results on...
Isolation of k -cliques IIPeter Borg aKurt Fenech aPawaton Kaemawichanurat b