Some edge‐fault‐tolerant properties of the folded hypercube
Abstract
In this article, we analyze some edge‐fault‐tolerant properties of the folded hypercube, a variant of the regular hypercube that is obtained by adding an edge to every pair of nodes with complementary addresses. We show that ann‐dimensional folded hypercube is (n− 2)‐edge‐fault‐tolerant Hamiltonian‐connected whenn(≥ 2) is even, (n− 1)‐edge‐fault‐tolerant strongly Hamiltonian‐laceable whenn(≥ 1) is odd, and (n− 2)‐edge‐fault‐tolerant hyper Hamiltonian‐laceable whenn(≥ 3) is odd. © 2007 Wiley Periodicals, Inc. NETWORKS, 2008Keywords
This publication has 16 references indexed in Scilit:
- Hamiltonicity of the Hierarchical Cubic NetworkTheory of Computing Systems, 2002
- Hamiltonian-laceability of star graphsNetworks, 2000
- Fault-free Hamiltonian cycles in faulty arrangement graphsIEEE Transactions on Parallel and Distributed Systems, 1999
- Hyper-Hamilton Laceable and Caterpillar-Spannable Product GraphsComputers & Mathematics with Applications, 1997
- 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
- Generalized Hypercube and Hyperbus Structures for a Computer NetworkIEEE Transactions on Computers, 1984
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981