% 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{\link[=centr_degree_tmax]{centr_degree_tmax()}} to create a more
consistent API.
}
\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree_tmax}{\code{centralization_degree_tmax()}}
}

\keyword{internal}
