In a graph, vertices that are more central are often placed at the intersection of
geodesics between other pairs of vertices. This model can be applied to organizational
networks, where we assume the flow of information follows shortest paths of
communication and there is a required action (i.e., signature or approval) by
each person located on these paths. The number of actions a person must
perform is linked to both the topology of the network as well as their location
within it. The number of expected actions that a person must perform can be
quantified by
betweenness centrality. The betweenness centrality of a vertex
is the ratio of shortest paths between all other pairs of vertices
and
in
which
appears to the total number of shortest paths from
to
. We
precisely compute the betweenness centrality for vertices in several families of graphs
motivated by different organizational networks.
PDF Access Denied
We have not been able to recognize your IP address
3.145.23.123
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.