Line Directed Hypergraphs - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2011

Line Directed Hypergraphs

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00643785 , version 1

Citer

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 Consultations
158 Téléchargements

Partager

Gmail Facebook X LinkedIn More