Line digraph iterations and the (d,k) problem for directed graphs

We consider in this paper the (d,k) problem for directed graphs: to maximize the number of vertices in a digraph of degree d and diameter k. For any values of d and k, we construct a graph with a number of vertices larger than (d 2−1)/d2 times the (non-attainable) Moore bound. In particular, this solves the (d,k) digraph problem for k&equil;2. We also show that these graphs can be obtained as line digraph iterations and that this technique provides us with a simple local routing algorithm for the corresponding networks.

[1]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.

[2]  Kenneth Steiglitz,et al.  The Design of Small-Diameter Networks by Local Search , 1979, IEEE Transactions on Computers.

[3]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[4]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[5]  Gérard Memmi,et al.  Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.

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

[7]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.