DISTANCES IN AN ARRAY: AN ALTERNATIVE DESCRIPTION FOR LARGE SCALE NETWORK TOPOLOGY.
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.
Norwood, Frederick; and Dotson, William P.. 1988. DISTANCES IN AN ARRAY: AN ALTERNATIVE DESCRIPTION FOR LARGE SCALE NETWORK TOPOLOGY.. Conference Proceedings - IEEE SOUTHEASTCON. 383-385. https://ieeexplore.ieee.org/document/194882?denied= ISSN: 0734-7502