Category:Definitions/Complete Graphs
Jump to navigation
Jump to search
This category contains definitions related to Complete Graphs.
Related results can be found in Category: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$.
Pages in category "Definitions/Complete Graphs"
The following 2 pages are in this category, out of 2 total.