ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2017-2018): c. 84%

Discussiones Mathematicae Graph Theory

Article in press


M. Krnc, J.-S. Sereni, R. Škrekovski, Z.B. Yilma


Eccentricity of networks with structural constraints


Discussiones Mathematicae Graph Theory

Received: 2017-04-18, Revised: 2018-06-18, Accepted: 2018-08-23,


The eccentricity of a node $v$ in a network is the maximum distance from $v$ to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network. The associated centralization measure then calculates the degree to which a network is dominated by a particular node. In this work, we determine the maximum value of eccentricity centralization as well as the most centralized networks for various classes of networks including the families of bipartite networks (two-mode data) with given partition sizes and tree networks with fixed number of nodes and fixed maximum degree. To this end, we introduce and study a new way of enumerating the nodes of a tree which might be of independent interest.


eccentricity, network, bipartite graph, complex network, maximum degree