cliques
find all complete subgraphs in the input graph, obeying
the size limitations given in the min
and max
arguments. largest.cliques
finds all largest cliques in the input graph. A
clique is largest if there is no other clique including more vertices.
maximal.cliques
finds all maximal cliques in the input graph.
A clique in maximal if it cannot be extended to a larger clique. The
largest cliques are always maximal, but a maximal clique is not
neccessarily the largest.
clique.number
calculates the size of the largest clique(s).
The current implementation of these functions searches
for maximal independent vertex sets (see
independent.vertex.sets
) in the complementer graph.