Hamilton Cycle Decomposition of the Butterfly Network
- 1 September 1998
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 08 (03) , 371-385
- https://doi.org/10.1142/s0129626498000389
Abstract
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 Barth and Raspaud who solved the case d = 2.Keywords
This publication has 0 references indexed in Scilit: