Hamiltonian connectivity in k-ary n-cubes under a region-based fault model
Authors:
- Yiquan WangYiquan Wang
- Jingfan ZaiJZJingfan Zai
- Ziyang LiuZLZiyang Liu
- Jingyi ChenJCJingyi Chen
- Eminjan SabirESEminjan Sabir
- 19 June 2026
- journal article
- Published by Elsevier in Information Sciences
- Vol. 755
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China
This publication has 32 references indexed in Scilit:
- Efficient fault tolerance and diagnosis mechanism for Network-on-ChipsJournal of Network and Computer Applications, 2025
- CIBORG: CIrcuit-Based and ORiented Graph theory permutation routing protocol for single-hop IoT networksJournal of Network and Computer Applications, 2024
- Reliability of augmented k-ary n-cubes under the extra connectivity conditionThe Journal of Supercomputing, 2023
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphsJournal of Graph Theory, 2022
- Matching preclusion for -ary -cubes with oddDiscrete Applied Mathematics, 2017
- LaCoDa: Layered connected topology for massive data centersJournal of Network and Computer Applications, 2017
- Reliability analysis and fault tolerance for hypercube multi-computer networksInformation Sciences, 2014
- Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubesJournal of Parallel and Distributed Computing, 2007
- On the fault-diameter of the star graphInformation Processing Letters, 1993
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950