centralization.degree.tmax: Theoretical maximum for degree centralization

In igraph: Network Analysis and Visualization

Theoretical maximum for degree centralization

Description

centralization.degree.tmax() was renamed to centr_degree_tmax() to create a more consistent API.

Usage

centralization.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 is 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(). Ignored if graph is given and the graph is undirected.
loops	Logical scalar, whether to consider loops edges when calculating the degree.

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