Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Covers and Independent Sets > FindClique >
Mathematica > Visualization and Graphics > Graphs & Networks > Graph Covers and Independent Sets > FindClique >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

FindClique

FindClique[g]
finds a clique with maximum number of vertices in the graph g.
MORE INFORMATION
  • 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.
EXAMPLESCLOSE ALL
Basic Examples   (2)
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]=
Scope   (2)
FindClique works with undirected graphs:
Directed graphs:
Properties & Relations   (3)
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
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF