Hamiltonicity of the hierarchical cubic network

DOI10.1007/s00224-001-1021-7zbMath0993.68003OpenAlexW2097019379MaRDI QIDQ1597762

Gen-Huey Chen, Jung-Sheng Fu

Publication date: 30 May 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1021-7

zbMATH Keywords

Gray codeshierarchical cubic network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (14)

Longest fault-free paths in hypercubes with vertex faults ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Extremal Results on Vertex and Link Residual Closeness ⋮ On conditional fault tolerance and diagnosability of hierarchical cubic networks ⋮ The generalized 4-connectivity of hierarchical cubic networks ⋮ On conditional fault tolerance of hierarchical cubic networks ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ Edge-bipancyclicity of a hypercube with faulty vertices and edges ⋮ Finding cycles in hierarchical hypercube networks ⋮ Some edge‐fault‐tolerant properties of the folded hypercube ⋮ Fault-tolerant cycle embedding in hierarchical cubic networks ⋮ Distance-based polynomials and topological indices for hierarchical hypercube networks ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ The hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks

This page was built for publication: Hamiltonicity of the hierarchical cubic network