Definition:Complete Graph

Let $$G = \left({V, E}\right)$$ be a simple graph such that every vertices is adjacent to every other vertex.

Then $$G$$ is called complete.

A complete graph of order $$p$$ is $p-1$-regular and is denoted $$K_p$$.

Examples
The first five complete graphs are shown below: