Density

Keyword: Density

The density of a graph G = (V,E) is the number of edges divided by the largest possible number of edges of the graph (i.e. |V|*(|V|-1)/2).