A Regular Network for Multicomputer Systems
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (1) , 60-69
- https://doi.org/10.1109/tc.1982.1675886
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- A large scale, homogeneous, fully distributed parallel machine, IPublished by Association for Computing Machinery (ACM) ,1977
- Computer Interconnection Structures: Taxonomy, Characteristics, and ExamplesACM Computing Surveys, 1975
- A trivalent graph of girth tenJournal of Combinatorial Theory, Series B, 1972
- On the impossibility of certain Moore graphsJournal of Combinatorial Theory, Series B, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- On (d, k) GraphsIEEE Transactions on Electronic Computers, 1967
- A Design for (d, k) GraphsIEEE Transactions on Electronic Computers, 1966
- On the Construction of (d, k) GraphsIEEE Transactions on Electronic Computers, 1965
- On Moore Graphs with Diameters 2 and 3IBM Journal of Research and Development, 1960
- A family of cubical graphsMathematical Proceedings of the Cambridge Philosophical Society, 1947