The clique operator on graphs with few imageʹs Original Research Article

The clique graph of a graph G is the intersection graph image of the (maximal) cliques of G. The iterated clique graphs image are defined by image and image and K is the clique operator. In this article we use the modular decomposition technique to characterize the K-behaviour of some classes of graphs with few imageʹs . These characterizations lead to polynomial time algorithms for deciding the K-convergence or K-divergence of any graph in the class.