article · RECERCAT (Consorci de Serveis Universitaris de Catalunya)
Line digraph iterations and the (d,k) digraph problem
Fiol Mora, Miquel Àngel, Andrés Yebra, José Luis, Alegre de Miguel, Ignacio
Cited by 0Open access
Abstract
This paper studies the behavior of the diameter and\nthe average distance between vertices of the line digraph of a given\ndigraph. The results obtained are then applied to the so-called\n(d, k) digraph problem, that is, to maximize the number of vertices\nin a digraph of maximum out-degree d and diameter k. By line\ndigraph iterations it is possible to construct digraphs with a number\nof vertices larger than (d2 - l)/d2 times the (nonattainable)\nMoore bound. In particular, this solves the (d, k) digraph problem\nfor k = 2. Also, the line digraph technique provides us with a\nsimple local routing algorithm for the corresponding networks.
Cite this paper
Fiol Mora, M. À., Andrés Yebra, J. L., & Alegre de Miguel, I. (n.d.). Line digraph iterations and the (d,k) digraph problem. RECERCAT (Consorci de Serveis Universitaris de Catalunya).
Fiol Mora, Miquel Àngel, et al. “Line digraph iterations and the (d,k) digraph problem.” RECERCAT (Consorci de Serveis Universitaris de Catalunya).
Fiol Mora, Miquel Àngel, José Luis Andrés Yebra, and Ignacio Alegre de Miguel. n.d.. “Line digraph iterations and the (d,k) digraph problem.” RECERCAT (Consorci de Serveis Universitaris de Catalunya).
Fiol Mora, M.À., Andrés Yebra, J.L. and Alegre de Miguel, I. (n.d.) ‘Line digraph iterations and the (d,k) digraph problem’, RECERCAT (Consorci de Serveis Universitaris de Catalunya).
@article{fiolmoraline,
title = {{Line digraph iterations and the (d,k) digraph problem}},
author = {Fiol Mora, Miquel Àngel and Andrés Yebra, José Luis and Alegre de Miguel, Ignacio},
journal = {RECERCAT (Consorci de Serveis Universitaris de Catalunya)}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.