An object is complete if nothing needs to be added to it.
An axiomatic theory is complete if every syntactically correct statement in the theory can be proven either right or wrong.
A graph is complete if any two of its vertices are connected by exactly one edge. A complete graph with N vertices is often denoted as KN.
A metric space is complete if all Cauchy sequences of its elements converge.