Fault-tolerant path embedding in folded hypercubes with both node and edge faults

DOI10.1016/j.tcs.2012.11.028zbMath1260.68016OpenAlexW2000966996MaRDI QIDQ1939282

Hsin-Hung Chou, Nai-Wen Chang, Sun-Yuan Hsieh, Che-Nan Kuo

Publication date: 4 March 2013

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

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

zbMATH Keywords

bipartite graphsinterconnection networksfault-tolerant embeddingfolded hypercubesfault-free pathsfaulty folded hypercubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (21)

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes ⋮ Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Two node-disjoint paths in balanced hypercubes ⋮ The vulnerability of the diameter of the enhanced hypercubes ⋮ On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Enhancing fault tolerance of balanced hypercube networks by the edge partition method ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ Cycles embedding on folded hypercubes with faulty nodes ⋮ Matching preclusion number in product graphs ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant

This page was built for publication: Fault-tolerant path embedding in folded hypercubes with both node and edge faults