This network should solely be used
for demonstration purposes as it does not describe a real network.
A different node is the most central by each of degree, closeness,
betweenness, and eigenvector centrality,
as in the graphs that Brandes and Hildenbrand (2014) discuss.
To convert into the two-mode version,
assign ison_centrality |> rename_nodes(mode = twomode_type).
Before version 2.5.0, this network was called ison_brandes.
#> -- # Centrality example --------------------------------------------------------
#> # A undirected network of 11 nodes and 12 ties
#>
#> -- Nodes
#> # A tibble: 11 x 1
#> twomode_type
#> <lgl>
#> 1 FALSE
#> 2 FALSE
#> 3 TRUE
#> 4 FALSE
#> 5 TRUE
#> 6 TRUE
#> # i 5 more rows
#>
#> -- Ties
#> # A tibble: 12 x 2
#> from to
#> <int> <int>
#> 1 1 3
#> 2 2 3
#> 3 3 4
#> 4 4 5
#> 5 4 6
#> 6 5 7
#> # i 6 more rows
#>ison_brandes is deprecated on 2026-11-15.
It is a copy of ison_centrality under its former name,
and will be removed in version 2.6.0.
Use ison_centrality instead.
Brandes, Ulrik, and Jan Hildenbrand. 2014. "Smallest graphs with distinct singleton centers". Network Science 2(3): 416-418. doi:10.1017/nws.2014.25