Title :
Dense Trivalent Graphs for Processor Interconnection
Author :
Leland, Will E. ; Solomon, Marvin H.
Author_Institution :
Department of Computer Sciences, University of Wisconsin
fDate :
3/1/1982 12:00:00 AM
Abstract :
This paper presents a new family of undirected graphs that allows N processors to be connected in a network of diameter 3/2 log2 N + O(1), while only requiring that each processor be connected to three neighbors. The best trivalent graphs previously proposed require a diameter of 2 log2N + O(1).
Keywords :
Cubic graphs; interconnection topology; multicomputer; undirected graphs; Broadcasting; Intelligent networks; Joining processes; Network topology; Relays; Telecommunication traffic; Cubic graphs; interconnection topology; multicomputer; undirected graphs;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1982.1675977
