centralization.evcent.tmax {igraph} | R Documentation |
Theoretical maximum for betweenness centralization
Description
centralization.evcent.tmax()
was renamed to centr_eigen_tmax()
to create a more
consistent API.
Usage
centralization.evcent.tmax(
graph = NULL,
nodes = 0,
directed = FALSE,
scale = TRUE
)
Arguments
graph |
The input graph. It can also be |
nodes |
The number of vertices. This is ignored if the graph is given. |
directed |
logical scalar, whether to use directed shortest paths for calculating betweenness. |
scale |
Whether to rescale the eigenvector centrality scores, such that the maximum score is one. |
[Package igraph version 2.0.3 Index]