Issue No. 02 - February (1984 vol. 33)
M.R. Jerrum , Department of Computer Science, University of Edinburgh
A construction is presented which, given a fixed undirected graph of low degree and small average path length, yields an infinite sequence of low diameter graphs of increasing order and fixed degree. As examples of the construction, infinite sequences of low diameter graphs are presented with degrees in the range 3 to 30. Expressed as a function of the order of the graphs, the degree 3 sequence ha
parallel computation, Graph theory, networks
S. Skyum and M. Jerrum, "Families of Fixed Degree Graphs for Processor Interconnection," in IEEE Transactions on Computers, vol. 33, no. , pp. 190-194, 1984.