Torus and Other Networks as Communication Networks With Up to Some Hundred Points
Von Conta · IEEE Transactions on Computers · 1983
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.