Source: wikibot/dense-graph
= Dense graph
{wiki=Dense_graph}
A **dense graph** is a type of graph in which the number of edges is close to the maximal number of edges that can exist between the vertices. More formally, a graph is considered dense if the ratio of the number of edges \\( E \\) to the number of vertices \\( V \\) squared, \\( \\frac\{E\}\{V^2\} \\), is relatively large.