Theoretical maximum for betweenness centralizationSource:
centralize() for a summary of graph centralization.
The input graph. It can also be
The number of vertices. This is ignored if the graph is given.
logical scalar, whether to use directed shortest paths for calculating betweenness.
Whether to rescale the eigenvector centrality scores, such that the maximum score is one.
Real scalar, the theoretical maximum (unnormalized) graph betweenness centrality score for graphs with given order and other parameters.