brandes.betweenness.centrality {RBGL}R Documentation

Compute betweenness centrality for an undirected graph

Description

Compute betweenness centrality for an undirected graph

Usage

brandes.betweenness.centrality(g)

Arguments

g an instance of the graph class with edgemode “undirected”

Details

brandes.betweenness.centrality computes the betweenness centrality of each vertex or each edge in the graph. The edge betweenness centrality indicates for each edge the betweenness centrality that was contributed to the target(s) of the edge (plural for undirected graphs). Edge betweenness centrality can be used to determine the edges through which most shortest paths must pass. Relative betweenness centrality scales each absolute centrality by “2/(n*n - 3n + 2)” (where n is the number of vertices in the graph). Dominance vertex is a measure of the maximum "betweenness" of any point in the graph: it will be 0 for complete graphs and 1 for "wheel" graphs.

Value

betweenness.centrality.vertices betweenness centrality of each vertex
betweenness.centrality.edges betweenness centrality of each edge
relative.betweenness.centrality.vertices relative betweenness centrality of each vertex
dominance maximum betweenness of any point in the graph

Author(s)

Li Long <li.long@isb-sib.ch>

References

Boost Graph Library by Siek et al.

See Also

Examples

coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL")))
coex@edgemode <- "undirected"
brandes.betweenness.centrality(coex)

[Package RBGL version 1.3.8 Index]