Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
Authors:
- Sun-Yuan HsiehSHSun-Yuan Hsieh
- Che-Nan KuoCKChe-Nan Kuo
- 1 April 2007
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 53 (7) , 1040-1044
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle modelJournal of Systems Architecture, 2005
- A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networksJournal of Parallel and Distributed Computing, 2002
- Fault-tolerant hamiltonian laceability of hypercubesInformation Processing Letters, 2002
- Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty LinksJournal of Parallel and Distributed Computing, 2001
- Hamiltonian-laceability of star graphsNetworks, 2000
- ForewordDiscrete Applied Mathematics, 1992
- EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHSJournal of Circuits, Systems and Computers, 1991
- Properties and performance of folded hypercubesIEEE Transactions on Parallel and Distributed Systems, 1991
- The twisted N-cube with application to multiprocessingIEEE Transactions on Computers, 1991
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981