# Category:Complete Graphs

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

## Subcategories

This category has the following 2 subcategories, out of 2 total.

## Pages in category "Complete Graphs"

The following 8 pages are in this category, out of 8 total.