% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centralization.R
\name{centr_degree_tmax}
\alias{centr_degree_tmax}
\title{Theoretical maximum for degree centralization}
\usage{
centr_degree_tmax(
  graph = NULL,
  nodes = 0,
  mode = c("all", "out", "in", "total"),
  loops
)
}
\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.}
}
\value{
Real scalar, the theoretical maximum (unnormalized) graph degree
centrality score for graphs with given order and other parameters.
}
\description{
See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
}
\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()}}
}

\examples{
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_degree(g, normalized = FALSE)$centralization \%>\%
  `/`(centr_degree_tmax(g, loops = FALSE))
centr_degree(g, normalized = TRUE)$centralization
}
\seealso{
Other centralization related: 
\code{\link{centr_betw}()},
\code{\link{centr_betw_tmax}()},
\code{\link{centr_clo}()},
\code{\link{centr_clo_tmax}()},
\code{\link{centr_degree}()},
\code{\link{centr_eigen}()},
\code{\link{centr_eigen_tmax}()},
\code{\link{centralize}()}
}
\concept{centralization related}
