Each pair of vertices in a complete graph is connected by an edge. Stated differently, it is an undirected graph in which every pair of distinct vertices is connected by a pair of unique edges. See the image below.