# Clique

From Algorithmist

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** () has edges.

From Algorithmist

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.

An **n-clique** () has edges.