Clique

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
An n-clique ($$K_n$$) has $${n \choose 2} = \frac{n(n-1)}{2}$$ edges.