dense graph
graph in which the number of edges is close to the maximum for its number of vertices
Facts
5 properties- Instance of
- asymptotically defined graph class
- Defining formula
- D = \frac{2|E|}{|V|\,(|V|-1)}\gg0[4]
- Opposite of
- sparse graph[3]
- Studied by
- graph theory[5]
🏷️ Also known as
en dense graph
cs hustý graf
de dichter Graph
es grafo denso
fa گراف متراکم
fr graphe dense
fr densité d'un graphe
he גרף צפוף
he צפיפות (תורת הגרפים)
hu gráfok sűrűsége
hu sűrű gráf
it densità di un grafo
ja 密グラフ
ko 밀집 그래프
nl dichte graaf
pl gęstość grafu
pl graf gęsty
ro graf dens
ru плотность графа
ru плотный граф
🔖 Identifiers · 5
- OpenAlex ID
- C13251829
- Image (Wikimedia Commons)
- GraphQL Logo.svg ↗
- Dictionary of Algorithms and Data Structures ID
- densegraph
- Freebase ID
- /m/0822g7
- Microsoft Academic ID (discontinued)
- 13251829
🔗 Connections
Subtypes 2
Maintained by WikiProject 1
Studied by 1
Subclass of 1
Press Enter · cited answer in seconds
0 sources
Summary
dense graph is an asymptotically defined graph class[1].