centr_betw_tmax: Theoretical maximum for betweenness centralization

In igraph: Network Analysis and Visualization

Theoretical maximum for betweenness centralization

Description

See centralize() for a summary of graph centralization.

Usage

centr_betw_tmax(graph = NULL, nodes = 0, directed = TRUE)

Arguments

graph	The input graph. It can also be NULL if nodes and directed are both given.
nodes	The number of vertices. This is ignored if the graph is given.
directed	Logical scalar, whether to use directed shortest paths for calculating betweenness. Ignored if an undirected graph was given.

Value

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

Related documentation in the C library

igraph_centralization_betweenness_tmax().

See Also

Other centralization related: centr_betw(), centr_clo(), centr_clo_tmax(), 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_betw(g, normalized = FALSE)$centralization %>%
  `/`(centr_betw_tmax(g))
centr_betw(g, normalized = TRUE)$centralization

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