Dense graph
id:
dense-graph-276-3962080
title:
Dense graph
text:
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges. The opposite, a graph with only a few edges, is a sparse graph. The distinction of what constitutes a dense or sparse graph is ill-defined, and is often represented by 'roughly equal to' statements. Due to this, the way that density is defined often depends on the context of the problem. The graph density of simple graphs is defined to be the ratio of the number of edges |E| with respec
brand slug:
wiki
category slug:
encyclopedia
description:
Graph with almost the max amount of edges
original url:
https://en.wikipedia.org/wiki/Dense_graph
date created:
date modified:
2024-03-25T06:11:59Z
main entity:
{"identifier":"Q3085841","url":"https://www.wikidata.org/entity/Q3085841"}
image:
fields total:
13
integrity:
14