nLab complete graph

Definition

Let $G = (V,E)$ be a simple, undirected graph. Then $G$ is said to be complete as a graph, if for every pair of vertices $(v_1,v_2) \in V \times V$, there exists a (unique) edge $e_{v_1,v_2} \in E$ between them.

Related concepts

• codiscrete groupoid

References

• Wikipedia, Complete graph