centralization.betweenness.tmax: Theoretical maximum for betweenness centralization

In igraph: Network Analysis and Visualization

Theoretical maximum for betweenness centralization

Description

centralization.betweenness.tmax() was renamed to centr_betw_tmax() to create a more consistent API.

Usage

centralization.betweenness.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.

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