# Centrality¶

## Degree¶

 degree_centrality(G) Compute the degree centrality for nodes. in_degree_centrality(G) Compute the in-degree centrality for nodes. out_degree_centrality(G) Compute the out-degree centrality for nodes.

## Eigenvector¶

 eigenvector_centrality(G[, max_iter, tol, ...]) Compute the eigenvector centrality for the graph G. eigenvector_centrality_numpy(G[, weight, ...]) Compute the eigenvector centrality for the graph G. katz_centrality(G[, alpha, beta, max_iter, ...]) Compute the Katz centrality for the nodes of the graph G. katz_centrality_numpy(G[, alpha, beta, ...]) Compute the Katz centrality for the graph G.

## Closeness¶

 closeness_centrality(G[, u, distance, ...]) Compute closeness centrality for nodes.

## Current Flow Closeness¶

 current_flow_closeness_centrality(G[, ...]) Compute current-flow closeness centrality for nodes.

## (Shortest Path) Betweenness¶

 betweenness_centrality(G[, k, normalized, ...]) Compute the shortest-path betweenness centrality for nodes. edge_betweenness_centrality(G[, k, ...]) Compute betweenness centrality for edges. betweenness_centrality_subset(G, sources, ...) Compute betweenness centrality for a subset of nodes. edge_betweenness_centrality_subset(G, ...[, ...]) Compute betweenness centrality for edges for a subset of nodes.

## Current Flow Betweenness¶

 current_flow_betweenness_centrality(G[, ...]) Compute current-flow betweenness centrality for nodes. edge_current_flow_betweenness_centrality(G) Compute current-flow betweenness centrality for edges. approximate_current_flow_betweenness_centrality(G) Compute the approximate current-flow betweenness centrality for nodes. current_flow_betweenness_centrality_subset(G, ...) Compute current-flow betweenness centrality for subsets of nodes. edge_current_flow_betweenness_centrality_subset(G, ...) Compute current-flow betweenness centrality for edges using subsets of nodes.

## Communicability Betweenness¶

 communicability_betweenness_centrality(G[, ...]) Return subgraph communicability for all pairs of nodes in G.

 load_centrality(G[, v, cutoff, normalized, ...]) Compute load centrality for nodes. edge_load_centrality(G[, cutoff]) Compute edge load.

## Subgraph¶

 subgraph_centrality(G) Return subgraph centrality for each node in G. subgraph_centrality_exp(G) Return the subgraph centrality for each node of G. estrada_index(G) Return the Estrada index of a the graph G.

## Harmonic Centrality¶

 harmonic_centrality(G[, nbunch, distance]) Compute harmonic centrality for nodes.

## Reaching¶

 local_reaching_centrality(G, v[, paths, ...]) Returns the local reaching centrality of a node in a directed graph. global_reaching_centrality(G[, weight, ...]) Returns the global reaching centrality of a directed graph.