Ek, Bryan; VerSchneider, Caitlin; Narayan, Darren A. - In: Physica A: Statistical Mechanics and its Applications 392 (2013) 21, pp. 5481-5489
The distance d(i,j) between any two vertices i and j in a graph is the number of edges in a shortest path between i and j. If there is no path connecting i and j, then d(i,j)=∞. In 2001, Latora and Marchiori introduced the measure of efficiency between vertices in a graph (Latora and...
