igraph (version 1.0.0)

centr_clo: Centralize a graph according to the closeness of vertices

Description

See centralize for a summary of graph centralization.

Usage

centr_clo(graph, mode = c("out", "in", "all", "total"), normalized = TRUE)

Arguments

graph
The input graph.
mode
This is the same as the mode argument of closeness.
normalized
Logical scalar. Whether to normalize the graph level centrality score by dividing by the theoretical maximum.

Value

  • A named list with the following components:
  • resThe node-level centrality scores.
  • centralizationThe graph level centrality index.
  • theoretical_maxThe maximum theoretical graph level centralization score for a graph with the given number of vertices, using the same parameters. If the normalized argument was TRUE, then the result was divided by this number.

See Also

Other centralization related: centr_betw_tmax, centralization.betweenness.tmax; centr_betw, centralization.betweenness; centr_clo_tmax, centralization.closeness.tmax; 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_degree(g)$centralization
centr_clo(g, mode = "all")$centralization
centr_betw(g, directed = FALSE)$centralization
centr_eigen(g, directed = FALSE)$centralization

Run the code above in your browser using DataCamp Workspace