On expansive graphs

The clique graph K ( G ) of a graph G , is the intersection graph of its (maximal) cliques, and G is K -divergent if the orders of its iterated clique graphs K ( G ) , K 2 ( G ) , K 3 ( 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 K -divergence.