Definition:Complete Graph

From ProofWiki
Jump to: navigation, search

Definition

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$.


Examples

The first five complete graphs are shown below:

CompleteGraphs.png


Also see



  • Results about complete graphs can be found here.


Sources