Sparse graph

Sparsity is the concept, useful in combinatorial mathematics and application areas such as network theory, of a low density of significant data or connections. For example a sparse matrix is one in which most of the entries are zero. Therefore a sparse graph is naturally defined as one in which the adjacency matrix is sparse.

This concept is amenable to quantitative reasoning. It is also noticeable in everyday life. Sparse data is by its nature more easily compressed.

See also:

• sparse graph code
• Pareto principle.