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.)
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.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 25 February 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "complete graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 25 February 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/completeGraph.html