Some large graphs with given degree and diameter

This paper considers the (Δ, D) problem: to maximize the order of graphs with given maximum degree Δ and diameter D, of importance for its implications in the design of interconnection networks. Two cubic graphs of diameters 5 and 8 and orders 70 and 286, respectively, and a graph of degree 5, diameter 3 and order 66 are presented, which improve the previously known orders for these values of Δ and D. By its construction, these graphs have a large automorphism group.

[1]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[2]  Karl W. Doty.  Large Regular Interconnection Networks , 1982, ICDCS.

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

[4]  Miguel Angel Fiol,et al.  Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.

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