Centralize a graph according to the betweenness of verticesSource:
centralize() for a summary of graph centralization.
The input graph.
logical scalar, whether to use directed shortest paths for calculating betweenness.
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.