This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1982 (vol. 31 no. 1)
pp. 60-69
B.W. Arden, Department of Electrical Engineering and Computer Science, Princeton University
As a result of recent technological developments there is an increasing interest in the interconnection of microcomputers through networks. For general computation the interconnection graphs should have short internode communication paths and should be of low degree, systematically structured, and incrementally extensible. A family of graphs, called multitree structured (MTS) having these properties is presented. The MTS graphs of degree three have the maximum number of nodes, known to date, for given diameters.
Index Terms:
regular networks, Moore bound, multicomputer system, multitree structured (MTS) graph
Citation:
B.W. Arden, null Hikyu Lee, "A Regular Network for Multicomputer Systems," IEEE Transactions on Computers, vol. 31, no. 1, pp. 60-69, Jan. 1982, doi:10.1109/TC.1982.1675886
Usage of this product signifies your acceptance of the Terms of Use.