The betweenness centrality of a graph

dc.contributor.author	Gago Álvarez, Silvia
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned	2007-05-10T13:40:03Z
dc.date.available	2007-05-10T13:40:03Z
dc.date.issued	2007-05-10
dc.identifier.uri	http://hdl.handle.net/2117/972
dc.description.abstract	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.
dc.format.extent	11
dc.language.iso	eng
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcsh	Graph theory
dc.subject.other	betweenness
dc.subject.other	mean distance
dc.subject.other	diameter
dc.subject.other	bounds
dc.title	The betweenness centrality of a graph
dc.type	Article
dc.subject.lemac	Teoria de grafs
dc.contributor.group	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.ams	Classificació AMS::05 Combinatorics::05C Graph theory
dc.rights.access	Open Access
dc.relation.projectidctt	TEC2005-03575
local.personalitzacitacio	true

UPCommons. Portal del coneixement obert de la UPC