nLab complete graph



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


Last revised on March 5, 2024 at 06:25:33. See the history of this page for a list of all contributions to it.