Betweenness centrality: Extremal values and structural properties

In this paper we investigate the structural properties of betweenness cen-trality and determine some cases in which betweenness reaches its extremal values. Special attention is paid to Star(G), the set of vertices adjacent to all other vertices in a graph and we prove several results about the betweenness of the elements of this set. We introduce the new concept of total betweenness and relate it to group betweenness. We prove a necessary and sufficient condition for the two measures to coincide. Next we consider cutsets and cutvertices and we find a lower bound for their betweenness; in particular for a cutvertex this lower bound is the cutting number. Finally we apply the previous results to trees, proving an alternative formula for betweenness based on cutvertex properties.