This is the documentation of pycliques. This is an extension to the library networkx in order to work with the clique graph operator.
A clique of a graph is a maximal complete subgraph. The clique graph of a graph is the intersection graph of the set of its cliques.
The clique graph of a graph G is denoted as K(G). We can define the iterated clique graphs as the graphs in the sequence: G, K(G), K^{2}(G)=K(K(G)), etc. A graph is divergent if the set of orders of the iterated clique graphs is unbounded, and the graph is convergent if it is not divergent. A major problem in the area is, given a graph G, deciding whether the graph is convergent or divergent.
This project has been set up using PyScaffold 3.1. For details and usage information on PyScaffold see https://pyscaffold.org/.