centr_degree_tmax: Theoretical maximum for degree centralization

In igraph: Network Analysis and Visualization

Theoretical maximum for degree centralization

Description

See centralize() for a summary of graph centralization.

Usage

centr_degree_tmax(
  graph = NULL,
  nodes = 0,
  mode = c("all", "out", "in", "total"),
  loops = FALSE
)

Arguments

graph	The input graph. It can also be NULL, if nodes, mode and loops are all given.
nodes	The number of vertices. This is ignored if the graph is given.
mode	This is the same as the mode argument of degree().
loops	Logical scalar, whether to consider loops edges when calculating the degree. Currently the default value is FALSE, but this argument will be required from igraph 1.4.0.

Value

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

See Also

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

Examples

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

igraph documentation built on Aug. 10, 2023, 9:08 a.m.