Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
DOI10.1016/J.TCS.2014.10.034zbMATH Open1303.68096OpenAlexW2059458834MaRDI QIDQ476903FDOQ476903
Authors: 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
Recommendations
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- Topological properties of incomplete WK-recursive networks
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- Two-node-Hamiltonicity of enhanced pyramid networks
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cites Work
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Title not available (Why is that?)
- The triangular pyramid: Routing and topological properties
- Edge fault tolerance in graphs
- Conditional edge-fault Hamiltonicity of augmented cubes
- Hamiltonianicity of the towers of Hanoi problem
- Towers of hanoi graphs
- The diameter of Hanoi graphs
- On the hamiltonicity of the Cartesian product
- Hamiltonicity of the hierarchical cubic network
- Title not available (Why is that?)
Cited In (5)
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- Two-node-Hamiltonicity of enhanced pyramid networks
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
This page was built for publication: Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476903)