NIST

complete graph

(definition)

Definition: An undirected graph with an edge between every pair of vertices.

Generalization (I am a kind of ...)
undirected graph, dense graph, connected graph.

Specialization (... is a kind of me.)
clique.

See also sparse graph, complete tree, perfect binary tree.

Note: A complete graph has n(n-1)/2 edges, where n is the number of vertices.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 25 February 2005.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "complete graph", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 25 February 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/completeGraph.html