Line Digraph Iterations and the (d, k) Digraph Problem

@article{Fiol1984LineDI,
  title={Line Digraph Iterations and the (d, k) Digraph Problem},
  author={Miguel Angel Fiol and Jos{\'e} Luis Andres Yebra and Ignacio Alegre de Miquel},
  journal={IEEE Transactions on Computers},
  year={1984},
  volume={C-33},
  pages={400-403}
}
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 larger than (d2- l)/d2times the (nonattainable) Moore bound. In particular, this solves the (d, k… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…