The clique graph K (G) of a simple graph G is the intersection graph of its maximal complete subgraphs, and we define iterated clique graphs by K0 (G) = G, Kn + 1 (G) = K (Kn (G)). We say that two graphs are homotopy equivalent if their simplicial complexes of complete subgraphs are so. From known results, it can be easily inferred that Kn (G) is homotopy equivalent to G for every n if G belongs to the class of clique-Helly graphs or to the class of dismantlable graphs. However, in both of these cases the collection of iterated clique graphs is finite up to isomorphism. In this paper, we show two infinite classes of clique-divergent graphs that satisfy G ≃ Kn (G) for all n, moreover Kn (G) and G are simple-homotopy equivalent. We provide some results on simple-homotopy type that are of independent interest. © 2008 Elsevier B.V. All rights reserved.
Larrión, F., Pizaña, M. A., & Villarroel-Flores, R. (2008). Equivariant collapses and the homotopy type of iterated clique graphs. Discrete Mathematics, 308(15), 3199–3207. https://doi.org/10.1016/j.disc.2007.06.021