(Q3085841)

English

dense graph

graph in which the number of edges is close to the maximum for its number of vertices

graph density

In more languages

edit

Statements

subclass of

graph

0 references

image

GraphQL Logo.svg
512 × 512; 3 KB

0 references

Complete tripartite graph.jpg
222 × 166; 10 KB

0 references

studied in

graph theory

0 references

defining formula

D={\frac {2|E|}{|V|\,(|V|-1)}}\gg 0

1 reference

imported from Wikimedia project

English Wikipedia

maintained by WikiProject

WikiProject Mathematics

0 references

opposite of

sparse graph

0 references

Identifiers

Dictionary of Algorithms and Data Structures ID

0 references

1 reference

28 October 2013

Microsoft Academic ID

0 references

1 reference

26 January 2022

https://docs.openalex.org/download-snapshot/snapshot-data-format

(Q3085841)

dense graph

Statements

Identifiers

Sitelinks

Wikipedia(11 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)