The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Optimal processor interconnection topologies
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
A Regular Network for Multicomputer Systems
IEEE Transactions on Computers
Interconnection Networks for Parallel and Distributed Processing: An Overview
IEEE Transactions on Computers
Analysis of Chordal Ring Network
IEEE Transactions on Computers
The Design of Small-Diameter Networks by Local Search
IEEE Transactions on Computers
Improved Construction Techniques for (d, k) Graphs
IEEE Transactions on Computers
Topological constraints on interconnection-limited logic
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
On Moore graphs with diameters 2 and 3
IBM Journal of Research and Development
Complete catalogue of graphs of maximum degree 3 and defect at most 4
Discrete Applied Mathematics
| Hi-index | 14.98 |
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.