1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centralization.R
\name{centralization.degree.tmax}
\alias{centralization.degree.tmax}
\title{Theoretical maximum for degree centralization}
\usage{
centralization.degree.tmax(
graph = NULL,
nodes = 0,
mode = c("all", "out", "in", "total"),
loops = FALSE
)
}
\arguments{
\item{graph}{The input graph. It can also be \code{NULL} if \code{nodes} is given.}
\item{nodes}{The number of vertices. This is ignored if the graph is given.}
\item{mode}{This is the same as the \code{mode} argument of \code{degree()}. Ignored
if \code{graph} is given and the graph is undirected.}
\item{loops}{Logical scalar, whether to consider loops edges when
calculating the degree.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
\code{centralization.degree.tmax()} was renamed to \code{centr_degree_tmax()} to create a more
consistent API.
}
\keyword{internal}
|
