Theoretical maximum for closeness centralization

See centralize() for a summary of graph centralization.

centr_clo_tmax(graph = NULL, nodes = 0, mode = c("out", "in", "all", "total"))

Arguments

graph

The input graph. It can also be NULL if nodes is given.

nodes

The number of vertices. This is ignored if the graph is given.

mode

This is the same as the mode argument of closeness(). Ignored if an undirected graph is given.

Value

Real scalar, the theoretical maximum (unnormalized) graph closeness centrality score for graphs with given order and other parameters.

See also

Other centralization related: centr_betw(), centr_betw_tmax(), centr_clo(), centr_degree(), centr_degree_tmax(), centr_eigen(), centr_eigen_tmax(), centralize()

Related documentation in the C library

igraph_centralization_closeness_tmax().

Examples

# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_clo(g, normalized = FALSE)$centralization %>%
  `/`(centr_clo_tmax(g))
#> [1] NaN
centr_clo(g, normalized = TRUE)$centralization
#> [1] NaN