A result on iterated clique graphs
Chong‐Keang Lim · Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · 1982
Abstract S. T. Hedetniemi and P. J. Slater have shown that if G is a triangle-free connected graph with at least three vertices, then where K(G) is the clique graph of G and K 2 ( G ) = K(K(G)) is the first iterated clique graph. In this paper, we generalize the above result to a wider class of graphs.