FindClique

FindClique[g]
finds a largest clique in the graph g.

FindClique[g,n]
finds a clique containing at most n vertices.

FindClique[g,{n}]
finds a clique containing exactly n vertices.

FindClique[g,{nmin,nmax}]
finds a clique containing between and vertices.

FindClique[g,nspec,s]
finds at most s cliques.

FindClique[{g,v},]
finds cliques that include the vertex v only.

DetailsDetails

  • A clique is a maximal set of vertices where the corresponding subgraph is a complete graph.
  • FindClique returns a list of cliques.
  • FindClique will return an empty list if there is no clique.
  • FindClique[,nspec,All] finds all the cliques.
  • For weighted graphs, FindClique gives a set of vertices with maximum sum of vertex weights.
  • FindClique works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.
Introduced in 2010
(8.0)
| Updated in 2014
(10.0)