igraph (version 1.0.0)

centr_clo_tmax: 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.

Value

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

See Also

Other centralization related: centr_betw_tmax, centralization.betweenness.tmax; centr_betw, centralization.betweenness; centr_clo, centralization.closeness; centr_degree_tmax, centralization.degree.tmax; centr_degree, centralization.degree; centr_eigen_tmax, centralization.evcent.tmax; centr_eigen, centralization.evcent; centralization, centralize, centralize.scores

Examples

Run this code
# 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

Run the code above in your browser using DataCamp Workspace