# centr_degree_tmax

##### Theoretical maximum for degree centralization

See `centralize`

for a summary of graph centralization.

##### Usage

```
centr_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`

,`mode`

and`loops`

are all 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`

.- loops
Logical scalar, whether to consider loops edges when calculating the degree.

##### Value

Real scalar, the theoratical maximum (unnormalized) graph degree centrality score for graphs with given order and other parameters.

##### See Also

Other centralization related: `centr_betw_tmax`

,
`centralization.betweenness.tmax`

;
`centr_betw`

,
`centralization.betweenness`

;
`centr_clo_tmax`

,
`centralization.closeness.tmax`

;
`centr_clo`

,
`centralization.closeness`

;
`centr_degree`

,
`centralization.degree`

;
`centr_eigen_tmax`

,
`centralization.evcent.tmax`

;
`centr_eigen`

,
`centralization.evcent`

;
`centralization`

, `centralize`

,
`centralize.scores`

##### Examples

```
# NOT RUN {
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_degree(g, normalized = FALSE)$centralization %>%
`/`(centr_degree_tmax(g))
centr_degree(g, normalized = TRUE)$centralization
# }
```

*Documentation reproduced from package igraph, version 1.0.1, License: GPL (>= 2)*