make_max_clique_graph(G, create_using=None, name=None)¶
Create the maximal clique graph of a graph.
Finds the maximal cliques and treats these as nodes. The nodes are connected if they have common members in the original graph. Theory has done a lot with clique graphs, but I haven’t seen much on maximal clique graphs.
This should be the same as make_clique_bipartite followed by project_up, but it saves all the intermediate steps.