Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
- 1 May 2021
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 294, 1-9
Abstract
No abstract availableKeywords
Funding Information
- Chaoyang University of Technology
- Technische Universiteit Delft
- Ministry of Science and Technology, Taiwan (MOST107-2218-E-005-023, MOST107-2221-E-324-020, MOST107-2622-E-324-002-CC3, MOST107-2821-C-324-001-ES)
- Ministry of Education
This publication has 16 references indexed in Scilit:
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubesInformation Sciences, 2010
- A further result on fault-free cycles in faulty folded hypercubesInformation Processing Letters, 2009
- 1-vertex-fault-tolerant cycles embedding on folded hypercubesDiscrete Applied Mathematics, 2009
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubesComputers & Mathematics with Applications, 2007
- Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty LinksJournal of Parallel and Distributed Computing, 2001
- Hyper-Hamilton Laceable and Caterpillar-Spannable Product GraphsComputers & Mathematics with Applications, 1997
- Conditional connectivity measures for large multiprocessor systemsIEEE Transactions on Computers, 1994
- 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