networkx.degree_centrality

degree_centrality(G, v=None)

Compute the degree centrality for nodes.

The degree centrality for a node v is the fraction of nodes it is connected to.

Parameters:

G : graph

A networkx graph

v : node, optional

Return only the value for node v.

Returns:

nodes : dictionary

Dictionary of nodes with degree centrality as the value.

See also

betweenness_centrality, load_centrality, eigenvector_centrality

Notes

The degree centrality is normalized to the maximum possible degree in the graph G. That is, G.degree(v)/(G.order()-1).