Clique (graph)

maths graph-theory
Clique (graph)

In an undirected graph $G = (V,E)$ a set of vertices $C \subset V$ is a clique if the induced subgraph on $C$ is the complete graph on $C$. (i.e. $\{(c,c') \vert \ c, c' \in C \mbox{ with } c \not = c'\} \subset E$.)