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,{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.

DetailsDetails

  • 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.
  • FindKClan works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Introduced in 2012
(9.0)
| Updated in 2014
(10.0)