Matjaz Krnc: On eccentricity centralization

Abstract. For a given node $v$ from a network $G$, eccentricity is the maximum distance from $v$ to any other node. In social networks, the inverse of eccentricity is used as a measure of importance of nodes in the network. In this talk, for the families of bipartite networks with given partition sizes, graphs with fixed maximal degree and number of nodes or edges, and all networks with fixed number of nodes or edges, we determine the maximum value of the eccentricity centralization that a node can achieve, and characterize the corresponding extremal networks.