This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
May 1984 (vol. 33 no. 5)
pp. 400-403
M.A. Fiol, Department of Mathematics, E. T. S. de Ing. de Telecomunicacion, Polytechnic University of Barcelona
This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of vertices in a digraph of maximum out-degree d and diameter k. By line digraph iterations it is possible to construct digraphs with a number of vertices larg
Index Terms:
routing algorithm, Communication network, (d, k) graph problem, line digraph, Moore bound
Citation:
M.A. Fiol, J.L.A. Yebra, I.A. De Miquel, "Line Digraph Iterations and the (d, k) Digraph Problem," IEEE Transactions on Computers, vol. 33, no. 5, pp. 400-403, May 1984, doi:10.1109/TC.1984.1676455
Usage of this product signifies your acceptance of the Terms of Use.