Line digraph iterations and the (d,k) problem for directed graphs
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
The Design of Small-Diameter Networks by Local Search
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Multiprocessor Architectures using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Queue layouts of iterated line directed graphs
Discrete Applied Mathematics
On the k-tuple domination of de Bruijn and Kautz digraphs
Information Processing Letters
Edge-connectivity and edge-superconnectivity in sequence graphs
Discrete Applied Mathematics
Large Graphs with Given Degree and Diameter Part I
IEEE Transactions on Computers
Super p-restricted edge connectivity of line graphs
Information Sciences: an International Journal
Asymptotically large (Δ,D)-graphs
Discrete Applied Mathematics
Sandpile groups and spanning trees of directed line graphs
Journal of Combinatorial Theory Series A
Restricted arc-connectivity of generalized p -cycles
Discrete Applied Mathematics
Cryptography and Security
Multilayer grid embeddings of iterated line digraphs
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 14.98 |
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