Families of Fixed Degree Graphs for Processor Interconnection

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 has diameter bounded above by 1.4722 log2 N + O(1), and the degree 4 sequence by 0.9083 log2N + O(1).

[1]  E. Bannai,et al.  On finite Moore graphs , 1973 .

[2]  Bernard Elspas,et al.  Topological constraints on interconnection-limited logic , 1964, SWCT.

[3]  R. M. Storwick,et al.  Improved Construction Techniques for (d, k) Graphs , 1970, IEEE Transactions on Computers.

[4]  R. M. Damerell.  On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  C. T. Benson.  Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.

[6]  Jean-Claude Bermond,et al.  Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .

[7]  Marvin H. Solomon,et al.  High Density Graphs for Processor Interconnection , 1981, Inf. Process. Lett..

[8]  Béla Bollobás,et al.  The diameter of random regular graphs , 1982, Comb..

[9]  Charles Delorme,et al.  Tables of Large Graphs with Given Degree and Diameter , 1982, Inf. Process. Lett..

[10]  Marvin H. Solomon,et al.  Dense Trivalent Graphs for Processor Interconnection , 1982, IEEE Transactions on Computers.