Every cluster graph is a block graph, a cograph, and a claw-free graph [REF].
When a cluster graph is formed from cliques that are all the same size, the overall graph is a homogeneous graph, meaning that every isomorphism between two of its induced subgraphs can be extended to an automorphism of the whole graph.