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, {nmin, nmax}]
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.


  • A k-clan is a k-clique where the diameter of the corresponding subgraph is at most k.
  • FindKClan returns a list of k-clans.
  • FindKClan will return an empty list if there is no k-clan.
  • FindKClan[..., k, nspec, All] finds all the k-clans.
New in 9
New to Mathematica? Find your learning path »
Have a question? Ask support »