sparse graph
graph in which the number of edges is much lower than the maximum for its number of vertices
Facts
5 properties- Instance of
- asymptotically defined graph class
- Defining formula
- D = \frac{2|E|}{|V|\,(|V|-1)}\ll1[4]
- Opposite of
- dense graph[3]
- Studied by
- graph theory[5]
🏷️ Also known as
en sparse graph
cs řídký graf
de dünner Graph
fr graphe creux
he גרף דליל
hu ritka gráf
it grafo sparso
nl ijle graaf
pt grafo esparso
ru разреженный граф
🔖 Identifiers · 1
- Image (Wikimedia Commons)
- Grafo3.jpg ↗
Press Enter · cited answer in seconds
0 sources
Summary
sparse graph is an asymptotically defined graph class[1].