# Centralize a graph according to the betweenness of vertices

Source:`R/centralization.R`

`centr_betw.Rd`

See `centralize()`

for a summary of graph centralization.

## Value

A named list with the following components:

- res
The node-level centrality scores.

- centralization
The graph level centrality index.

- theoretical_max
The maximum theoretical graph level centralization score for a graph with the given number of vertices, using the same parameters. If the

`normalized`

argument was`TRUE`

, then the result was divided by this number.

## See also

Other centralization related:
`centr_betw_tmax()`

,
`centr_clo()`

,
`centr_clo_tmax()`

,
`centr_degree()`

,
`centr_degree_tmax()`

,
`centr_eigen()`

,
`centr_eigen_tmax()`

,
`centralize()`

## Examples

```
# A BA graph is quite centralized
g <- sample_pa(1000, m = 4)
centr_degree(g)$centralization
#> [1] 0.1618335
centr_clo(g, mode = "all")$centralization
#> [1] 0.437051
centr_betw(g, directed = FALSE)$centralization
#> [1] 0.2764392
centr_eigen(g, directed = FALSE)$centralization
#> [1] 0.9486925
```