Theoretical maximum for degree centralization
See centralize for a summary of graph centralization.
centr_degree_tmax(
graph = NULL,
nodes = 0,
mode = c("all", "out", "in", "total"),
loops = FALSE
)graph |
The input graph. It can also be |
nodes |
The number of vertices. This is ignored if the graph is given. |
mode |
This is the same as the |
loops |
Logical scalar, whether to consider loops edges when calculating the degree. |
Real scalar, the theoretical maximum (unnormalized) graph degree centrality score for graphs with given order and other parameters.
Other centralization related:
centr_betw_tmax(),
centr_betw(),
centr_clo_tmax(),
centr_clo(),
centr_degree(),
centr_eigen_tmax(),
centr_eigen(),
centralize()
# A BA graph is quite centralized g <- sample_pa(1000, m = 4) centr_degree(g, normalized = FALSE)$centralization %>% `/`(centr_degree_tmax(g)) centr_degree(g, normalized = TRUE)$centralization
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.