Hamilton cycles and paths in butterfly graphs
From MaRDI portal
Publication:4894877
DOI10.1002/NET.3230260304zbMATH Open0855.05080OpenAlexW2048025954MaRDI QIDQ4894877FDOQ4894877
Authors: Stephen A. Wong
Publication date: 7 October 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230260304
Recommendations
Cites Work
Cited In (14)
- The forwarding indices of wrapped butterfly networks
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Hyper Hamiltonian laceability on edge fault star graph
- Cycles in butterfly graphs
- Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
- Compatible Hamilton decompositions of directed wrapped butterfly graphs
- Hamiltonian-laceability of star graphs
- Two edge-disjoint hamiltonian cycles in the butterfly graph
- Minimum spanners of butterfly graphs
- Hamiltonian properties of enhanced honeycomb networks
- Fault-free longest paths in star networks with conditional link faults
- Some problems on Cayley graphs
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
This page was built for publication: Hamilton cycles and paths in butterfly graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894877)