Theoretical maximum for betweenness centralization — centralization.evcent.tmax • igraph

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 consider edge directions during the calculation. Ignored in undirected graphs.
scale: Ignored. Computing eigenvector centralization requires normalized eigenvector centrality scores.

centralization_eigenvector_centrality_tmax()