Publication | Open Access
Notes on the betweenness centrality of a graph
39
Citations
16
References
2011
Year
Geometric Graph TheoryNetwork ScienceGraph TheoryEngineeringExtremal Graph TheoryStructural Graph TheoryAverage DistanceNetwork AnalysisEducationComputational ComplexityBetweenness CentralityDiscrete MathematicsMetric Graph TheoryCombinatorial OptimizationGraph AnalysisGraph AlgorithmUpper BoundsSocial Network Analysis
Abstract The betweenness centrality of a vertex of a graph is the portion of the shortest paths between all pairs of vertices passing through a given vertex. We study upper bounds for this invariant and its relations to the diameter and average distance of a graph.
| Year | Citations | |
|---|---|---|
Page 1
Page 1