\begin{definition}[Definition:Complete Graph]
Let $G = \struct {V, E}$ be a simple graph such that every vertex is adjacent to every other vertex.
Then $G$ is called '''complete'''.
The '''complete graph''' of order $p$ is denoted $K_p$.
\end{definition}