% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centralization.R
\name{centr_betw_tmax}
\alias{centr_betw_tmax}
\title{Theoretical maximum for betweenness centralization}
\usage{
centr_betw_tmax(graph = NULL, nodes = 0, directed = TRUE)
}
\arguments{
\item{graph}{The input graph. It can also be \code{NULL} if
\code{nodes} and \code{directed} are both given.}

\item{nodes}{The number of vertices. This is ignored if the graph is
given.}

\item{directed}{Logical scalar, whether to use directed shortest paths
for calculating betweenness. Ignored if an undirected graph was
given.}
}
\value{
Real scalar, the theoretical maximum (unnormalized) graph
betweenness 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_betweenness_tmax}{\code{centralization_betweenness_tmax()}}
}

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