Theoretical maximum for degree centralizationSource:
centralize() for a summary of graph centralization.
centr_degree_tmax( graph = NULL, nodes = 0, mode = c("all", "out", "in", "total"), loops = FALSE )
The input graph. It can also be
loopsare all given.
The number of vertices. This is ignored if the graph is given.
This is the same as the
Logical scalar, whether to consider loops edges when calculating the degree. Currently the default value is
FALSE, but this argument will be required from igraph 1.4.0.
Real scalar, the theoretical maximum (unnormalized) graph degree centrality score for graphs with given order and other parameters.