Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

networkx.algorithms.centrality.in_degree_centrality

in_degree_centrality(G)

Compute the in-degree centrality for nodes.

The in-degree centrality for a node v is the fraction of nodes its incoming edges are connected to.

Parameters

G (graph) – A NetworkX graph

Returns

nodes – Dictionary of nodes with in-degree centrality as values.

Return type

dictionary

Raises

NetworkXNotImplemented: – If G is undirected.

See also

degree_centrality(), out_degree_centrality()

Notes

The degree centrality values are normalized by dividing by the maximum possible degree in a simple graph n-1 where n is the number of nodes in G.

For multigraphs or graphs with self loops the maximum degree might be higher than n-1 and values of degree centrality greater than 1 are possible.