Find subgraph centrality scores of network positions

subgraph.centrality() was renamed to subgraph_centrality() to create a more consistent API.

Usage

subgraph.centrality(graph, diag = FALSE)

Arguments

graph

The input graph. It will be treated as undirected.

diag

Boolean scalar, whether to include the diagonal of the adjacency matrix in the analysis. Giving FALSE here effectively eliminates the loops edges from the graph before the calculation.

Related documentation in the C library

is_directed(), get_adjacency(), get_adjacency_sparse(), vcount(), edges(), get_eids(), ecount()