The performance of a network can be measured by assuming that information flows along shortest paths and that the efficiency in the communication between two nodes i and j is inversely proportional to their shortest distance dij, i.e. the smallest sum of arc weights of all possible paths from i to j. Namely, the efficiency index E of a graph, is defined as [36]:(2)
