complete graph

views updated

complete graph A graph G in which there is an edge joining every pair of distinct vertices; every vertex is adjacent to every other vertex. If G contains n vertices then the number of edges is n(n – 1)/2

About this article

complete graph

Updated About encyclopedia.com content Print Article Share Article