The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1984 vol.33)
pp: 400-403
M.A. Fiol , Department of Mathematics, E. T. S. de Ing. de Telecomunicacion, Polytechnic University of Barcelona
ABSTRACT
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
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool