0

I need to have two pieces of information, given a graph G:

  1. The number of cliques in G.
  2. The relative size of those cliques.

For example: there are 3 cliques of size 3, 10 cliques of size 4, 7 cliques of size 5 etc.

I am using Python and I know there are many functions defined in the library networkx. Can anyone help me get these results?

Blackwood
  • 4,504
  • 16
  • 32
  • 41
  • 3
    A minimal amount of searching led me to https://networkx.github.io/documentation/development/reference/generated/networkx.algorithms.clique.enumerate_all_cliques.html You're welcome – Niklas B. Dec 23 '15 at 15:27
  • I think you will find it difficult to find a network with 10 cliques of size 4 and only 3 of size 3. – Joel Jan 05 '16 at 12:58
  • That was only an example. I know it is impossible to have that result, I have only written an example of the kind of result i want to read. – Diego Fosso Jan 06 '16 at 19:21

0 Answers0