Keyword

graph diameter

Description: The greatest shortest-path distance between any pair of vertices in a graph, a measure studied in graph theory and network analysis.

Primary topic: Graph theory and applications (20%)

Wikidata ID: wiki/Q16628701

OpenAlex ID: keywords/graph-diameter

Spectral Graph Theory

1996 · Fan Chung · Regional conference series in mathematics · 5,750

THE LAPLACIAN SPECTRUM OF GRAPHS y

1991 · Bojan Mohar · 1,085

Geometric Bounds for Eigenvalues of Markov Chains

1991 · Persi Diaconis, Daniel Stroock · The Annals of Applied Probability · 874

PDF

Random Graph Dynamics

2006 · Rick Durrett · Cambridge University Press eBooks · 785

The Laplacian spectrum of graphs

2001 · Michael Newman · Library and Archives Canada (Government of Canada) · 652

PDF

The Diameter of a Scale-Free Random Graph

2004 · B�la Bollob�s*, Oliver Riordan · COMBINATORICA · 595

CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays

2005 · Spyros Voulgaris, Daniela Gavidia, et al. · Journal of Network and Systems Management · 510

Scalable GPU graph traversal

2012 · Duane Merrill, Michael Garland, et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 508

On Moore Graphs with Diameters 2 and 3

1960 · A. J. Hoffman, R. R. Singleton · IBM Journal of Research and Development · 489

Interlacing eigenvalues and graphs

1995 · Willem H. Haemers · Linear Algebra and its Applications · 466

PDF

On graph problems in a semi-streaming model

2005 · Joan Feigenbaum, Sampath Kannan, et al. · Theoretical Computer Science · 408

On the extraconnectivity of graphs

1996 · J. Fàbrega, M.A. Fiol · Discrete Mathematics · 406

PDF

Isoperimetric numbers of graphs

1989 · Bojan Mohar · Journal of Combinatorial Theory Series B · 332

PDF

Subgraph Isomorphism in Planar Graphs and Related Problems

1999 · David Eppstein · Journal of Graph Algorithms and Applications · 329

Diameter and Treewidth in Minor-Closed Graph Families

2000 · D. Eppstein · Algorithmica · 313

PDF

Eigenvalues, diameter, and mean distance in graphs

1991 · Bojan Mohar · Graphs and Combinatorics · 301

Denser than the densest subgraph

2013 · Charalampos Tsourakakis, Francesco Bonchi, et al. · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · 294

Effective graph resistance

2011 · W. Ellens, F.M. Spieksma, et al. · Linear Algebra and its Applications · 273

PDF

Efficient Parallel Graph Exploration on Multi-Core CPU and GPU

2011 · Sungpack Hong, Tayo Oguntebi, et al. · International Conference on Parallel Architectures and Compilation Techniques · 271

Diameters and Eigenvalues

1989 · F. R. K. Chung · Journal of the American Mathematical Society · 266

PDF

Graph-theoretic analysis of structured peer-to-peer systems

2003 · Dmitri Loguinov, Anuj Kumar, et al. · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · 229

Scalable modeling of real graphs using Kronecker multiplication

2007 · Jure Leskovec, Christos Faloutsos · International Conference on Machine Learning · 220

Low diameter graph decompositions

1993 · Nathan Linial, Michael Saks · COMBINATORICA · 208

Ricci curvature and eigenvalue estimate on locally finite graphs

2010 · Yong Lin, Shing-Tung Yau · Mathematical Research Letters · 200

PDF

On the geodetic number of a graph

2001 · Gary Chartrand, Frank Harary, et al. · Networks · 198

Works count: 4,929

Citation count: 54,850