sparse graph
graph in which the number of edges is much lower than the maximum for its number of vertices
Press Enter · cited answer in seconds
0 sources
sparse graph
Summary
sparse graph is an asymptotically defined graph class[1]. It draws 6 Wikipedia views per month (asymptotically_defined_graph_class category, ranking #3 of 3).[2]
Key Facts
- sparse graph's image is recorded as Grafo3.jpg[3].
- sparse graph's image is recorded as Graphe.png[4].
- sparse graph's instance of is recorded as asymptotically defined graph class[5].
- sparse graph's subclass of is recorded as graph[6].
- sparse graph's opposite of is recorded as dense graph[7].
- sparse graph's defining formula is recorded as D = \frac{2|E|}{|V|\,(|V|-1)}\ll1[8].
- sparse graph's studied by is recorded as graph theory[9].
- sparse graph's maintained by WikiProject is recorded as WikiProject Mathematics[10].
Why It Matters
sparse graph draws 6 Wikipedia views per month (asymptotically_defined_graph_class category, ranking #3 of 3).[2]