centr_clo_tmax: Theoretical maximum for closeness centralization

In igraph: Network Analysis and Visualization

Theoretical maximum for closeness centralization

Description

See centralize() for a summary of graph centralization.

Usage

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.

Related documentation in the C library

igraph_centralization_closeness_tmax().

See Also

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

Examples

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

igraph documentation built on Oct. 20, 2024, 1:06 a.m.