Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
From MaRDI portal
(Redirected from Publication:476903)
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
Cites work
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 922807 (Why is no real title available?)
- Conditional edge-fault Hamiltonicity of augmented cubes
- Edge fault tolerance in graphs
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Hamiltonianicity of the towers of Hanoi problem
- Hamiltonicity of the hierarchical cubic network
- On the hamiltonicity of the Cartesian product
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- The diameter of Hanoi graphs
- The triangular pyramid: Routing and topological properties
- Towers of hanoi graphs
Cited in
(5)- Fault-tolerant Hamiltonian connectivity of the WK-recursive 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
- Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks
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)