Torus and Other Networks as Communication Networks With Up to Some Hundred Points
- 1 July 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (7), 657-666
- https://doi.org/10.1109/tc.1983.1676297
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- A Regular Network for Multicomputer SystemsIEEE Transactions on Computers, 1982
- Analysis of Chordal Ring NetworkIEEE Transactions on Computers, 1981
- The Design of Small-Diameter Networks by Local SearchIEEE Transactions on Computers, 1979
- On the impossibility of certain Moore graphsJournal of Combinatorial Theory, Series B, 1971
- Improved Construction Techniques for (d, k) GraphsIEEE Transactions on Computers, 1970
- A Design for (d, k) GraphsIEEE Transactions on Electronic Computers, 1966
- On the Construction of (d, k) GraphsIEEE Transactions on Electronic Computers, 1965
- Topological constraints on interconnection-limited logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1964
- On Moore Graphs with Diameters 2 and 3IBM Journal of Research and Development, 1960
- Die Theorie der regulären graphsActa Mathematica, 1891