The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs whose graph union is G, such that whenever every pair of such complete graphs in some subfamily F' has a nonempty graph intersection, the intersection of all members of F' is not empty.

clique | clique number | complete graph