Definition:Complete Graph

From ProofWiki
Jump to navigation Jump to search

This page is about Complete Graph. For other uses, see Complete.

Definition

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


Examples

The first five complete graphs are shown below:

CompleteGraphs.png


Also see




  • Results about complete graphs can be found here.


Sources