Distances in an array: an alternative description for large scale network topology
F. Norwood, William P. Dotson · 2003
In the complete graph on an (m, n) array, methods are given for finding how many links have a given length and for finding the average length of a link. A method is also given for finding the average length of a link in a graph where there is an upper bound on the length of a link.>