Line directed hypergraphs

Authors:
Jean-Claude Bermond;Fahir Ergincan;Michel Syska
Affiliations:
MASCOTTE, joint project CNRS-INRIA-UNS, Sophia-Antipolis, France;Ericsson Canada Inc., Ottawa, Ontario, Canada;MASCOTTE, joint project CNRS-INRIA-UNS, Sophia-Antipolis, France
Venue:
Cryptography and Security
Year:
2012

Citing 6
Cited 0

Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing
Connectivity of Imase and Itoh Digraphs

IEEE Transactions on Computers
Table of large (&Dgr;, D)-graphs

Discrete Applied Mathematics - Special double volume: interconnection networks
Bus interconnection networks

Discrete Applied Mathematics
Multiwavelength Optical Networks: A Layered Approach

Multiwavelength Optical Networks: A Layered Approach
Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we generalize the concept of line digraphs to line dihypergraphs. We give some general properties in particular concerning connectivity parameters of dihypergraphs and their line dihypergraphs, like the fact that the arc connectivity of a line dihypergraph is greater than or equal to that of the original dihypergraph. Then we show that the De Bruijn and Kautz dihypergraphs (which are among the best known bus networks) are iterated line digraphs. Finally we give short proofs that they are highly connected.