On expansive graphs

The clique graph K(G)K(G) of a graph GG, is the intersection graph of its (maximal) cliques, and GG is KK-divergent   if the orders of its iterated clique graphs K(G),K2(G),K3(G),…K(G),K2(G),K3(G),… tend to infinity. A coaffine   graph has a symmetry that maps each vertex outside of its closed neighbourhood. For these graphs we study the notion of expansivity, which implies KK-divergence.