Issue No. 07 - July (1983 vol. 32)
C. Von Conta , Institut fur Informatik, Technische Universitat Munchen
To be used as message passing networks of computers we consider graphs of degree D and diameter K. To obtain bounds for the average distance Ak (and K) with any given number N of nodes and given D we generalize Moore graphs to Moore* graphs minimizing Ak.
Torus networks, Dense (d, k) graphs, distributed processing, message passing networks, network architectures, regular networks
C. Von Conta, "Torus and Other Networks as Communication Networks With Up to Some Hundred Points", IEEE Transactions on Computers, vol. 32, no. , pp. 657-666, July 1983, doi:10.1109/TC.1983.1676297