Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 316

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Betweenness centrality measures for directed graphs

Open access
White, Douglas R., Borgatti, Stephen P.·1994·Social Networks

Abstract

This paper generalizes Freeman’s geodesic centrality measures for betweenness on undirected graphs to the more general directed case. Four steps are taken. The point centrality measure is first generalized for directed graphs. Second, a unique maximally centralized graph is defined for directed graphs, holding constant the numbers of points with reciprocatable (incoming and outgoing) versus only unreciprocatable (outgoing only or incoming only) arcs, and focusing the measure on the maximally central arrangement of arcs within these constraints. Alternatively, one may simply normalize on the number of arcs. This enables the third step of defining the relative behveenness centralities of a point, independent of the number of points. This normalization step for directed centrality measures removes Gould’s objection that centrality measures for directed graphs are not interpretable because they lack a standard for maximality. The relative directed centrality converges with Freeman’s betweenness measure in the case of undirected graphs with no isolates. The fourth step is to define the measures of this concept of graph centralization in terms of the dominance of the most central point.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0378-8733(94)90015-9

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 9 references

Cited by

See all 316

Metadata

Authors
White, D. R., & Borgatti, S. P.
Venue
Social Networks
Publisher
Elsevier BV
Published
1994-10
Volume
16
Issue
4
Pages
335-346
ISSN
0378-8733 (ISSN-L)
OpenAlex
W2130522879
Cited by
316
References
9
FWCI
0.58
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Betweenness centrality measures for directed graphs. https://app.cochat.ai/papers/10.1016/0378-8733(94)90015-9
The paper
White, D. R., & Borgatti, S. P. (1994). Betweenness centrality measures for directed graphs. Social Networks. https://doi.org/10.1016/0378-8733(94)90015-9

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.