Graph Diameter
Graph Diameter is a metric in graph theory that denotes the longest shortest path length between any pair of vertices in a connected graph, serving as a measure of the graph's overall connectivity and scale.
502
Publications
24.2K
Citations
826
Authors
432
Institutions
Publications per year
2017–2026
62
Parents
502
The Spread of Behavior in an Online Social Network Experiment
Damon Centola · Science · 2010 · 2.7K citations
Resolvability in graphs and the metric dimension of a graph
Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics · 2000 · 982 citations
The Diameter of a Scale-Free Random Graph
Oliver Riordan · COMBINATORICA · 2004 · 610 citations
THE MAXIMUM CONNECTIVITY OF A GRAPH
Frank Harary · Proceedings of the National Academy of Sciences · 1962 · 331 citations
Diameter and Treewidth in Minor-Closed Graph Families
David Eppstein · Algorithmica · 2000 · 329 citations · Full text
1–5 of 502
826
11
h-index
11
h-index
8
h-index
8
h-index
7
h-index
1–5 of 826
432
Universitat Politècnica de Catalunya
Barcelona, Spain
16 h-index
58 publications
2.8K citations
Université Paris-Sud
Orsay, France
12 h-index
16 publications
720 citations

University of Johannesburg
Johannesburg, South Africa
11 h-index
21 publications
400 citations

University of KwaZulu-Natal
Durban, South Africa
11 h-index
19 publications
450 citations
Central China Normal University
Wuhan, China
10 h-index
15 publications
337 citations

University of Ljubljana
Ljubljana, Slovenia
10 h-index
15 publications
552 citations

University of Waterloo
Waterloo, Canada
10 h-index
13 publications
508 citations
University of Science and Technology of China
Hefei, China
8 h-index
13 publications
328 citations
1–8 of 432
57 publications · 1.8K citations
25
h-index
40 publications · 2K citations
22
h-index
25 publications · 1K citations
18
h-index
33 publications · 1.4K citations
18
h-index
22 publications · 594 citations
16
h-index
1–5