Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes

DOI10.1016/J.TCS.2014.10.034zbMath1303.68096OpenAlexW2059458834MaRDI QIDQ476903

Yi-Chun Wang, Justie Su-Tzu Juan

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.034

zbMATH Keywords

pyramidtopologyHamiltonian-connected\(\mathrm{WKP}_{(d,L)}\)\(k\)-node HamiltonianWK-recursive

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• The diameter of Hanoi graphs
• The triangular pyramid: Routing and topological properties
• Conditional edge-fault Hamiltonicity of augmented cubes
• On the hamiltonicity of the Cartesian product
• Hamiltonicity of the hierarchical cubic network
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Hamiltonianicity of the towers of Hanoi problem
• Towers of hanoi graphs
• Edge fault tolerance in graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes