Line Digraph Iterations and the (d, k) Digraph Problem
- 1 May 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (5) , 400-403
- https://doi.org/10.1109/tc.1984.1676455
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 largKeywords
This publication has 7 references indexed in Scilit:
- Line Digraph Iterations and the (d, k) Digraph ProblemIEEE Transactions on Computers, 1984
- A Design for Directed Graphs with Minimum DiameterIEEE Transactions on Computers, 1983
- Tables of large graphs wh given degree and diameterInformation Processing Letters, 1982
- Some New Results About the (d, k) Graph ProblemIEEE Transactions on Computers, 1982
- Design to Minimize Diameter on Building-Block NetworkIEEE Transactions on Computers, 1981
- On the impossibility of Directed Moore GraphsJournal of Combinatorial Theory, Series B, 1980
- The Design of Small-Diameter Networks by Local SearchIEEE Transactions on Computers, 1979