Dense graph
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 between sparse and dense graphs is rather vague, and depends on the context. The graph density of simple graphs is defined to be the ratio of the number of edges with respect to the maximum possible edges. For undirected simple graphs, the graph density is: For directed simple graphs, the maximum possible edges is twice that of undirected graphs to account for the directedness, so the density is:
Dense graph1-planar graphAdjacency listAdjacency matrixArboricityBellman–Ford algorithmBeta skeletonBiclique-free graphBook embeddingBounded expansionBron–Kerbosch algorithmBrooks' theoremBurr–Erdős conjectureBéla BollobásCereceda's conjectureChernoff boundClaw-free graphClique-widthClique (graph theory)Clique problemComplement graphConsumer networkCrispin Nash-WilliamsDegeneracy (graph theory)Density (disambiguation)Density (graph theory)Dijkstra's algorithmDirected acyclic graphEdmonds' algorithmEquitable coloringExpander graphFloyd–Warshall algorithmFulkerson PrizeGlossary of graph theoryGraph (abstract data type)Graph densityGraph minorGraph powerGraph theoryGraph traversal
Link from a Wikipage to another Wikipage
Wikipage disambiguates
Wikipage redirect
primaryTopic
Dense graph
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 between sparse and dense graphs is rather vague, and depends on the context. The graph density of simple graphs is defined to be the ratio of the number of edges with respect to the maximum possible edges. For undirected simple graphs, the graph density is: For directed simple graphs, the maximum possible edges is twice that of undirected graphs to account for the directedness, so the density is:
has abstract
En matemàtiques, un graf dens ...... la Cota superior asimptòtica
@ca
En mathématiques, et plus part ...... t vague et dépend du contexte.
@fr
En teoría de grafos, la densid ...... a la cota superior asintótica.
@es
In mathematics, a dense graph ...... and the minimal density is 0 .
@en
Sia definito il grafo G=(N,A) ...... a un ristretto numero di nodi.
@it
Пло́тный граф — граф, в которо ...... на 0 — для несвязанного графа.
@ru
У математиці граф називається ...... інімальна густина дорівнює 0 .
@uk
수학에서 밀집 그래프(dense graph)는 간선(변 ...... 도는 1(완전 그래프의 경우)이며 최소 밀도는 0이다.
@ko
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,026,074,786
Link from a Wikipage to another Wikipage
label
Dense graph
@en
Densidad (teoría de grafos)
@es
Densità di un grafo
@it
Densité d'un graphe
@fr
Graf dens
@ca
Плотный граф
@ru
Щільний граф
@uk
밀집 그래프
@ko
wikiPageUsesTemplate
subject
comment
En matemàtiques, un graf dens ...... la Cota superior asimptòtica
@ca
En mathématiques, et plus part ...... t vague et dépend du contexte.
@fr
En teoría de grafos, la densid ...... ndría si fuera un grafo vacío.
@es
In mathematics, a dense graph ...... rectedness, so the density is:
@en
Sia definito il grafo G=(N,A) ...... Δ = 2L / n(n-1) Δ = L / n(n-1)
@it
Пло́тный граф — граф, в которо ...... на 0 — для несвязанного графа.
@ru
У математиці граф називається ...... інімальна густина дорівнює 0 .
@uk
수학에서 밀집 그래프(dense graph)는 간선(변 ...... 도는 1(완전 그래프의 경우)이며 최소 밀도는 0이다.
@ko