The betweenness centrality of a graph

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/972

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Gago Álvarez, Silvia
dc.date	2007-05-10
dc.identifier.uri	http://hdl.handle.net/2117/972
dc.language.iso	eng
dc.relation	TEC2005-03575
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	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	Graph theory
dc.subject	betweenness
dc.subject	mean distance
dc.subject	diameter
dc.subject	bounds
dc.subject	Teoria de grafs
dc.subject	Classificació AMS::05 Combinatorics::05C Graph theory
dc.title	The betweenness centrality of a graph
dc.type	info:eu-repo/semantics/article
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.

Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia

Coronicová Hurajová, Jana; Gago Álvarez, Silvia; Madaras, Tomas

Gago Álvarez, Silvia

Gago Álvarez, Silvia; Hurajová, Jana; Madaras, Tomas

Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia

Coordinación

Patrocinio