The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1984 vol.33)
pp: 190-194
M.R. Jerrum , Department of Computer Science, University of Edinburgh
ABSTRACT
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
INDEX TERMS
parallel computation, Graph theory, networks
CITATION
M.R. Jerrum, S. Skyum, "Families of Fixed Degree Graphs for Processor Interconnection", IEEE Transactions on Computers, vol.33, no. 2, pp. 190-194, February 1984, doi:10.1109/TC.1984.1676410
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool