An Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density

László Gulyás, Gábor Horváth, Tamás Cséri +1

Many real world networks (graphs) are observed to be 'small worlds', i.e., the average path length among nodes is small. On the other hand, it is somewhat unclear what other averag…