On the Connectivity and the Diameter of Betweenness-Uniform Graphs

09/22/2021
by   David Hartman, et al.
0

Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of betweenness-uniform graphs. In particular, we show that every connected betweenness-uniform graph is either a cycle or a 3-connected graph. Also, we show that betweenness uniform graphs of high maximal degree have small diameter.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset