This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)

FindClique

FindClique[g]
finds a clique with maximum number of vertices in the graph g.
  • A clique is a set of vertices where the corresponding subgraph is a complete graph.
  • FindClique will return an empty list if there is no clique.
Find a clique in a complete graph:
Find a clique in a directed graph:
Find a clique in a complete graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Find a clique in a directed graph:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
FindClique works with undirected graphs:
Directed graphs:
A clique in a graph is an independent vertex set of its complement graph:
The vertex complement of a clique in a graph is a vertex cover of its complement graph:
The largest clique in a complete graph has all its vertices:
New in 8