So I can find the Wiki article okay, as I think I understand that this is a definition of a special community in a graph.  However their image in Fig. 1 confuses me from the description.As I understand it, the definition of a clique percolation within a graph is:You have a set of k-maximal cliques, which contain k nodes.You are said to have k-adjacent cliques if each k-maximal cliques are connected by (k-1)-nodes.So a graph that was (1)<-->(2)<-->(3) could be considered a community because it has 2 2-maximal cliques, [[1,2], [2,3]], and each of them are connected by 1 vertex. Am I reading the Wiki correctly, because I feel like I'm missing something. Thanks for any help your able to lend.
Help with the definition of clique percolation
graph theory;graph algorithms;clique