# Complete graph

on $n$ vertices
The undirected graph on a vertex set $\{v_1,\ldots,v_n\}$ in which any two distinct vertices are joined by an edge: denoted $K_n$.