Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
average degree
Description:
A graph-theoretic measure equal to the mean number of edges incident to each vertex in a graph.
Primary topic:
Complex Network Analysis Techniques (23%)
Related topics:
Complex Network Analysis Techniques (23%),
Limits and Structures in Graph Theory (20%),
Advanced Graph Theory Research (12%)
OpenAlex ID:
keywords/average-degree
Greedy Approximation Algorithms for Finding Dense Components in a Graph
2000
·
Moses Charikar
·
Lecture notes in computer science
·
655
Network synchronization, diffusion, and the paradox of heterogeneity
2005
·
Adilson E. Motter
, Changsong Zhou
, et al.
·
Physical Review E
·
581
PDF
Extremal Graph Theory
2017
·
Reinhard Diestel
·
Graduate texts in mathematics
·
429
Analysis and Classification of Sleep Stages Based on Difference Visibility Graphs From a Single-Channel EEG Signal
2014
·
Guohun Zhu
, Yan Li
, et al.
·
IEEE Journal of Biomedical and Health Informatics
·
409
Enhancing complex-network synchronization
2005
·
A. E Motter
, C. S Zhou
, et al.
·
Europhysics Letters (EPL)
·
391
PDF
Avalanche Collapse of Interdependent Networks
2012
·
G. J. Baxter
, S. N. Dorogovtsev
, et al.
·
Physical Review Letters
·
389
PDF
Synchronization transitions on scale-free neuronal networks due to finite information transmission delays
2009
·
Qingyun Wang
, Matjaž Perc
, et al.
·
Physical Review E
·
388
PDF
Lower bound of the hadwiger number of graphs by their average degree
1984
·
A. V. Kostochka
·
COMBINATORICA
·
375
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
2013
·
Charalampos Tsourakakis
, Francesco Bonchi
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
374
Universality in the Synchronization of Weighted Random Networks
2006
·
Changsong Zhou
, Adilson E. Motter
, et al.
·
Physical Review Letters
·
361
PDF
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
1997
·
M. M. Halldórsson
, J. Radhakrishnan
·
Algorithmica
·
309
A note on the independence number of triangle-free graphs
1983
·
James B. Shearer
·
Discrete Mathematics
·
309
PDF
Seed size strongly affects cascades on random networks
2007
·
James P. Gleeson
, Diarmuid J. Cahalane
·
Physical Review E
·
305
Generic Absorbing Transition in Coevolution Dynamics
2008
·
Federico Vazquez
, Víctor M. Eguíluz
, et al.
·
Physical Review Letters
·
298
PDF
Spectral techniques applied to sparse random graphs
2005
·
Uriel Feige
, Eran Ofek
·
Random Structures and Algorithms
·
292
List Edge and List Total Colourings of Multigraphs
1997
·
O.V. Borodin
, A.V. Kostochka
, et al.
·
Journal of Combinatorial Theory Series B
·
276
Finding Dense Subgraphs with Size Bounds
2009
·
Reid Andersen
, Kumar Chellapilla
·
Lecture notes in computer science
·
255
How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision
2022
·
Kim, Dongkwan
, Oh, Alice
·
arXiv (Cornell University)
·
247
PDF
A note on the irregularity of graphs
1992
·
F.K. Bell
·
Linear Algebra and its Applications
·
192
PDF
Sharp concentration of the chromatic number on random graphsG n, p
1987
·
Eli Shamir
, Joel Spencer
·
COMBINATORICA
·
191
Enhancing the transmission efficiency by edge deletion in scale-free networks
2007
·
Guo-Qing Zhang
, Di Wang
, et al.
·
Physical Review E
·
178
Accuracy of mean-field theory for dynamics on real-world networks
2012
·
James P. Gleeson
, Sergey Melnik
, et al.
·
Physical Review E
·
173
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
1986
·
A. V. Kostochka
·
Translations - American Mathematical Society/Translations
·
160
Consistency thresholds for the planted bisection model
2016
·
Elchanan Mossel
, Joe Neeman
, et al.
·
Electronic Journal of Probability
·
154
Dynamic concentration of the triangle-free process
2013
·
Tom Bohman
, Peter Keevash
·
Random Structures and Algorithms
·
154
PDF
Show more works
View as search
Works count:
1,303
Citation count:
24,530
Year
Topic
Type