Complete Graph

1 min read Last updated Mon May 25 2026 17:06:29 GMT+0000 (Coordinated Universal Time)

A simple graph where every pair of vertices is adjacent. Denoted by $K_n$ where $n$ is the number of vertices.

Contains the maximum number of edges for a simple graph.

|E| = \frac{n(n-1)}{2}

Was this helpful?