[igraph] Betweennes centrality (maximum and normalization)

[Stefan Kroeger]

Hi,

I hope it's okay to ask a pretty special question to betweenes
centrality (BC) and not directly related to igraph.

(mention: I deal with the node-related BC in undirected graphs.)

my two problems/questions are:
(i) Is the highest measure BC of network, also the theoretical hightest
reachable (maximum) BC for the graph?

(ii) Is there a way to normalize the betweennes centrality measures to
be able to compare between different graph?


thanks a lot
Stefan