Line Directed Hypergraphs

Jean-Claude Bermond 1 Fahir Ergincan 2 Michel Syska 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Type de document :
Chapitre d'ouvrage
Cryptoquater2011 ,Festchrift Jean-jacques,, Springer verlag, pp.1-11, 2011, Lecture Notes in Computer Science, 6805
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00643785
Contributeur : Jean-Claude Bermond <>
Soumis le : mardi 22 novembre 2011 - 17:45:23
Dernière modification le : mercredi 23 novembre 2011 - 08:51:26
Document(s) archivé(s) le : vendredi 16 novembre 2012 - 11:50:35

Fichier

jjq.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00643785, version 1

Collections

Citation

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>

Partager

Métriques

Consultations de
la notice

296

Téléchargements du document

110