in_degree_centrality¶

in_degree_centrality
(G)[source]¶ Compute the indegree centrality for nodes.
The indegree 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 indegree centrality as values. Return type: dictionary Raises: NetworkXError
– If the graph is undirected.See also
Notes
The degree centrality values are normalized by dividing by the maximum possible degree in a simple graph n1 where n is the number of nodes in G.
For multigraphs or graphs with self loops the maximum degree might be higher than n1 and values of degree centrality greater than 1 are possible.