## Centrality in valued graphs: A measure of betweenness based on network flow (1991)

by
Linton C. Freeman
,
Stephen P. Borgatti
,
Douglas R. White

Citations: | 64 - 6 self |

### BibTeX

@MISC{Freeman91centralityin,

author = {Linton C. Freeman and Stephen P. Borgatti and Douglas R. White},

title = { Centrality in valued graphs: A measure of betweenness based on network flow},

year = {1991}

}

### OpenURL

### Abstract

A new measure of centrality, C,, is introduced. It is based on the concept of network flows. While conceptually similar to Freeman’s original measure, Ca, the new measure differs from the original in two important ways. First, C, is defined for both valued and non-valued graphs. This makes C, applicable to a wider variety of network datasets. Second, the computation of C, is not based on geodesic paths as is C, but on all the independent paths between all pairs of points in the network.