Clique

From Algorithmist
Jump to: navigation, search

An n-clique (or simply clique) is a simple undirected graph G with n vertices, such that every two vertices of G are connected by an edge.

Properties[edit]

An n-clique (K_{n}) has {n \choose 2}={\frac  {n(n-1)}{2}} edges.