# Category:Complete Graphs

This category contains results about Complete Graphs.

Let $G = \left({V, E}\right)$ 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$.

## Pages in category "Complete Graphs"

The following 3 pages are in this category, out of 3 total.