A graph which has a link between every pair of nodes. A complete bipartite graph can be partitioned into two subsets of nodes such that each node is joined to every node in the other subset.

Last updated: 1995-01-24

Try this search on Wikipedia, OneLook, Google

**Nearby terms:**
Complementary Metal Oxide Semiconductor « complementary nondeterministic polynomial « complete « **complete graph** » complete inference system » complete lattice » complete metric space

Loading

Copyright Denis Howe 1985