Graph in which any two vertices are connected by at least one edge.
- A complete graph is a simple graph in which all the vertices are adjacent, which means that every pair of vertices is connected by an edge.
- A complete graph is a simple graph in which all possible edges appear.
Example
This is a complete graph, because each vertex is connected to all the other vertices in the graph:
