Line Directed Hypergraphs - Archive ouverte HAL Access content directly
Book Sections Year : 2011

Line Directed Hypergraphs


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.
Fichier principal
Vignette du fichier
jjq.pdf (131.79 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00643785 , version 1 (22-11-2011)


  • HAL Id : hal-00643785 , version 1


Jean-Claude Bermond, Fahir Ergincan, Michel Syska. Line Directed Hypergraphs. Cryptoquater2011 ,Festchrift Jean-jacques,, Springer verlag, pp.1-11, 2011, Lecture Notes in Computer Science, 6805. ⟨hal-00643785⟩
315 View
167 Download


Gmail Mastodon Facebook X LinkedIn More