Sparse graph
= Sparse graph
A family of <graphs> is sparse when its <edge> count grows substantially more slowly than the square of its <vertex> count; a common convention is that $m=O(n)$, where $n$ and $m$ count <vertices> and <edges>. State the intended asymptotic convention explicitly. An <adjacency list> then uses fewer storage entries than an <adjacency matrix>.