id: 06043790
dt: a
an: 06043790
au: Bermond, Jean-Claude; Ergincan, Fahir; Syska, Michel
ti: Line directed hypergraphs.
so: Naccache, David (ed.), Cryptography and security: From theory to
    applications. Essays dedicated to Jean-Jacques Quisquater on the
    occasion of his 65th birthday. Berlin: Springer (ISBN
    978-3-642-28367-3/pbk). Lecture Notes in Computer Science 6805, 25-34
    (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: Hypergraphs; Line Hypergraphs; De Bruijn and Kautz networks; Connectivity
ci: 
li: doi:10.1007/978-3-642-28368-0_5
ab: Summary: 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.
rv: