- Article
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
- Weiyan Wu and
- Eminjan Sabir
One of the important issues in evaluating an interconnection network is to study the hamiltonian cycle embedding problems. A graph G is spanning k-edge-cyclable if for any k independent edges e1,e2,…,ek of G, there exist k vertex-disjoint cycl...

