Centralize a graph according to the closeness of verticesSource:
centralize() for a summary of graph centralization.
centr_clo(graph, mode = c("out", "in", "all", "total"), normalized = TRUE)
The input graph.
This is the same as the
Logical scalar. Whether to normalize the graph level centrality score by dividing by the theoretical maximum.
A named list with the following components:
The node-level centrality scores.
The graph level centrality index.
The maximum theoretical graph level centralization score for a graph with the given number of vertices, using the same parameters. If the
TRUE, then the result was divided by this number.