A Regular Network for Multicomputer Systems
IEEE Transactions on Computers
Families of Fixed Degree Graphs for Processor Interconnection
IEEE Transactions on Computers
IEEE Transactions on Computers
Dense Trivalent Graphs for Processor Interconnection
IEEE Transactions on Computers
On the Connectivity of Some Telecommunications Networks
IEEE Transactions on Computers
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
New Designs for Dense Processor Interconnection Networks
IEEE Transactions on Computers
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Improved Construction Techniques for (d, k) Graphs
IEEE Transactions on Computers
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
The Organization of High-Speed Memory for Parallel Block Transfer of Data
IEEE Transactions on Computers
Largest graphs of diameter 2 and maximum degree 6
General Theory of Information Transfer and Combinatorics
The Maximum Degree & Diameter-Bounded Subgraph and its Applications
Journal of Mathematical Modelling and Algorithms
| Hi-index | 0.03 |
Consideration is given to the manner and extent to which propagation delay and terminal packing factors may constrain the interconnection of modules making up large digital network. When formulated in graph-theoretical terms these considerations give rise to the problem of finding linear graphs with a maximum number, n, of nodes for a given degree, d, and diameter, k--a generalization of the problem of finding Moore graphs. A number of inequalities are derived that serve to delimit the function n(d, k), although its precise law of growth remains unknown. Maximal graphs have been found for several cases where Moore graphs are known not to exist. Finally, several interesting techniques are demonstrated for constructing families of graphs, which, though the are usually submaximal, possess a useful regularity of structure.