Dismantlings and iterated clique graphs

Given a graph G and two vertices x,y∈V(G), we say that x is dominated by y if the closed neighbourhood of x is contained in that of y. Here we prove that if x is a dominated vertex, then G and G−{x} have the same dynamical behaviour under the iteration of the clique operator.