Category:Complete Graphs

From ProofWiki
Jump to navigation Jump to search

This category contains results about Complete Graphs.


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