Show simple item record

dc.contributor.authorGago Álvarez, Silvia
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2007-05-10T13:40:03Z
dc.date.available2007-05-10T13:40:03Z
dc.date.issued2007-05-10
dc.identifier.urihttp://hdl.handle.net/2117/972
dc.description.abstractA 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.extent11
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshGraph theory
dc.subject.otherbetweenness
dc.subject.othermean distance
dc.subject.otherdiameter
dc.subject.otherbounds
dc.titleThe betweenness centrality of a graph
dc.typeArticle
dc.subject.lemacTeoria de grafs
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.rights.accessOpen Access
dc.relation.projectidcttTEC2005-03575
local.personalitzacitaciotrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record