Issue No.03 - March (1982 vol.31)
W.E. Leland , Department of Computer Sciences, University of Wisconsin
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 log<inf>2</inf>N + O(1).
undirected graphs, Cubic graphs, interconnection topology, multicomputer
W.E. Leland, M.H. Solomon, "Dense Trivalent Graphs for Processor Interconnection", IEEE Transactions on Computers, vol.31, no. 3, pp. 219-222, March 1982, doi:10.1109/TC.1982.1675977