A complete graph where edge density is minimized; that is, the complete graph has the minimum number of edges possible for a given number of vertices.
A complete graph where edge density is minimized; that is, the complete graph has the minimum number of edges possible for a given number of vertices.