Hamilton Cycle Decomposition of the Butterfly Network - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1996

Hamilton Cycle Decomposition of the Butterfly Network

Eric Darrot
  • Function : Author
Olivier Delmas
Stéphane Pérennes
  • Function : Author
  • PersonId : 942945

Abstract

In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and \linebreak \mbox{A.~Raspaud} who solved the case $d=3D2$.
Fichier principal
Vignette du fichier
RR-2920.pdf (182.49 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073777 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073777 , version 1

Cite

Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Stéphane Pérennes. Hamilton Cycle Decomposition of the Butterfly Network. RR-2920, INRIA. 1996. ⟨inria-00073777⟩
117 View
392 Download

Share

Gmail Facebook Twitter LinkedIn More