Figure 3
From: Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods
For k = 2, the whole graph builds one 2-clique community, because each edge is a 2-clique, and the graph is connected. For k = 3, there are two 3-clique communities, one consisting of the left hand K4 and K3, the other consisting of the right hand K3 and K4. The node in the middle of the graph is contained in both 3-node communities. For k = 4, each of the K4s builds one 4-clique community.