centralization.evcent.tmax: Theoretical maximum for betweenness centralization

In igraph/rigraph: Network Analysis and Visualization

Theoretical maximum for betweenness centralization

Description

centralization.evcent.tmax() was renamed to centr_eigen_tmax() to create a more consistent API.

Usage

centralization.evcent.tmax(
  graph = NULL,
  nodes = 0,
  directed = FALSE,
  scale = 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.
scale	Whether to rescale the eigenvector centrality scores, such that the maximum score is one.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.