Explore relationships

Maximal clique

In graph theory, a clique ( or ) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. That is, a clique of a graph G{\displaystyle G} is an induced subgraph of G{\displaystyle G} that is complete.

Use + to expand a branch. Click a topic name to open its summary.