Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
From MaRDI portal
Publication:726341
DOI10.1016/j.ins.2014.02.087zbMath1341.68016OpenAlexW2038886572MaRDI QIDQ726341
Jimmy J. M. Tan, Tung-Yang Ho, Lih-Hsing Hsu, Cheng-Kuan Lin
Publication date: 8 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.087
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (5)
Super spanning connectivity on WK-recursive networks ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Fault-Hamiltonicity of Cartesian products of directed cycles ⋮ Fault-tolerant Hamiltonian connectivity of the WK-recursive networks ⋮ Mutually orthogonal Hamiltonian connected graphs
Cites Work
- Unnamed Item
- Fault-tolerant Hamiltonicity of twisted cubes
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- Arc coverings of graphs
- Ring embedding in faulty pancake graphs
- Mutually orthogonal Hamiltonian connected graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
This page was built for publication: Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
