Answers are grounded in this paper and cite their sources.
Analysis reveals optimal Hamiltonian cycle and path under faulty conditions in hypercube networks, suggesting enhanced reliability for parallel computing.
The [Formula: see text]-dimensional generalized base [Formula: see text]-hypercube [Formula: see text] is one of the most attractive interconnection networks for parallel and distributed computing systems. Particularly, the hypercube [Formula: see text] and the ternary cube [Formula: see text] are special cases of [Formula: see text] for [Formula: see text] and [Formula: see text] respectively. There are plenty of papers about the fault-tolerant Hamiltonicity of [Formula: see text] for [Formula: see text]. In the paper, we obtain: [Formula: see text] there exists a Hamiltonian cycle in [Formula: see text] if the cardinality of faulty elements(vertices and/or edges) is at most [Formula: see text](resp. the cardinality of faulty sub-structures of [Formula: see text] is at most [Formula: see text]); [Formula: see text] there exists a Hamiltonian path connecting two arbitrary distinct healthy vertices in [Formula: see text] if the cardinality of faulty elements is no more than [Formula: see text](resp. the cardinality of faulty sub-structures of [Formula: see text] is no more than [Formula: see text]). All results are optimal due to the regularity [Formula: see text] of [Formula: see text]. We also conduct numerical experiments to verify our theoretical findings.
No takes yet. Share an insight, caveat, or question.
Sabir et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: