The betweenness centrality of a graph
A measure of the centrality of a vertex of a graph is the portion of shortest paths crossing through it between other vertices of the graph. This is called betweenness centrality and here we study some of its general properties, relations with distance parameters (diameter, mean distance), local parameters, symmetries, etc. Some bounds for this parameter are obtained, using them to improve known bounds for the mean distance of the graph.
Graph theory, Àrees temàtiques de la UPC::Matemàtiques i estadística, mean distance, Classificació AMS::05 Combinatorics::05C Graph theory, bounds, betweenness, diameter, Teoria de grafs
Graph theory, Àrees temàtiques de la UPC::Matemàtiques i estadística, mean distance, Classificació AMS::05 Combinatorics::05C Graph theory, bounds, betweenness, diameter, Teoria de grafs
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!