Wolfram Language & System 10.4 (2016)|Legacy Documentation
finds a largest k-clique in the graph g.
finds a k-clique containing at most n vertices.
finds a k-clique containing exactly n vertices.
finds a k-clique containing between and vertices.
finds at most s k-cliques.
finds k-cliques that include the vertex v only.
uses rules to specify the graph g.
- A k-clique is a maximal set of vertices that are at a distance no greater than k from each other.
- FindKClique returns a list of k-cliques.
- FindKClique will return an empty list if there is no k-clique.
- FindKClique[…,k,nspec,All] finds all the k-cliques.
- FindKClique works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
- FindKClique finds one or more k-cliques in a graph, returning them as a list of vertices. Here, a k-clique is a maximal set of vertices that are at a distance no greater than k from each other. k-cliques are used in project selection, pattern matching, finance, and network analysis.
- FindKClique can be used to find k-cliques of different sizes, from 1 to the largest possible size (in general n for a graph on n vertices). FindKClique can be used to find a single k-clique of specified size, a specified number of cliques, or all.
- 1-cliques are cliques. All k-clans are k-cliques, but the converse is not always true. Related functions include FindClique, FindKClan, FindKClub, and FindKPlex.