This documents the development version of NetworkX. Documentation for the current release can be found here.
Compute the group degree centrality for a group of nodes.
Group degree centrality of a group of nodes \(S\) is the fraction of non-group members connected to group members.
A NetworkX graph.
- Slist or set
S is a group of nodes which belong to G, for which group degree centrality is to be calculated.
Group degree centrality of the group S.
If node(s) in S are not in G.
The measure was introduced in .
The number of nodes in the group must be a maximum of n - 1 where
nis the total number of nodes in the graph.
M G Everett and S P Borgatti: The Centrality of Groups and Classes. Journal of Mathematical Sociology. 23(3): 181-201. 1999. http://www.analytictech.com/borgatti/group_centrality.htm