Category:Complete Graphs
Jump to navigation
Jump to search
This category contains results about Complete Graphs.
Definitions specific to this category can be found in Definitions/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$.
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
E
- Examples of Complete Graphs (2 P)
Pages in category "Complete Graphs"
The following 12 pages are in this category, out of 12 total.