FindKClan

FindKClan[g, k]
finds a largest k-clan in the graph g.

FindKClan[g, k, n]
finds a k-clan containing at most n vertices.

FindKClan[g, k, {n}]
finds a k-clan containing exactly n vertices.

FindKClan[g, k, {n_min, n_max}]
finds a k-clan containing between and vertices.

FindKClan[g, k, nspec, s]
finds at most s k-clans.

FindKClan[{g, v}, k, ...]
finds k-clans that include the vertex v only.