A **complete graph** is a undirected graph in which every pair of distinct vertices is connected by an unique edge.

A **complete graph** is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).

Complete graph can also be described as a graph in which every two vertices are neighbouring.

Complete Graph with

The number of edges in a complete graph can be found using binomial coefficients: