centr_betw_tmax: Theoretical maximum for betweenness centralization

Description Usage Arguments Value See Also Examples

View source: R/auto.R

Description

See centralize for a summary of graph centralization.

Usage

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

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.

directed

logical scalar, whether to use directed shortest paths for calculating betweenness.

Value

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

See Also

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

Examples

1
2
3
4
5
# 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

Example output

Attaching package: 'igraph'

The following objects are masked from 'package:stats':

    decompose, spectrum

The following object is masked from 'package:base':

    union

[1] 0.001097051
[1] 0.001097051

igraph documentation built on March 19, 2020, 5:13 p.m.