Éric Darrot

  • Citations Per Year
Learn More
in this paper, we prove that the wrapped Butterfly digraph ~ WBF(d; n) of degree d and dimension n contains at least d?1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We also conjecture that ~ WBF(d; n) can be decomposed into d Hamilton circuits, except for {d = 2 and n = 2}, {d = 2 and n = 3} and {d = 3 and n = 2}. We show that it(More)
in this paper, we prove that the wrapped Butterfly graph WBF(d; n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2. Key-words: Butterfly graph, graph theory, Hamiltonism, Hamilton decomposition, Hamilton cycle, Hamilton circuit, perfect matching. (Résumé : tsvp)(More)
This article deals with the design of networks to be loaded on satellites. These networks should connect inputs (corresponding to signals arriving on the satellite) to outputs (corresponding to ampli ers), even in case of failures of ampli ers. They are made of links and expensive switches, hence we want to minimise the number of switches subject to the(More)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Stéphane Perennes* Thème 1 — Réseaux et systèmes Projet SLOOP Rapport de recherche n ̊???? — Juillet 1996 — 25 pages Abstract: in this paper, we prove that the wrapped Butterfly digraph ~ WBF(d; n) of degree d and dimensionn contains at least d 1 arc-disjoint Hamilton circuits, answering a conjecture of D.(More)
These three di erent research goals articulate one with another in the construction of the Sloop system each level uses the primitives and possibilities of the layer just underneath Figure summarizes the system structure and topics The bottom layer deals with communication algo rithms mapping strategies both static and dynamic and overlapping communication(More)
  • 1