Path embedding in faulty hypercubes

DOI10.1016/j.amc.2007.03.003zbMath1193.05099OpenAlexW2080518514MaRDI QIDQ990515

Meijie Ma, Xiang-Feng Pan, Gui Zhen Liu

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.003

zbMATH Keywords

hypercubeembeddingpathfault-toleranceinterconnection network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Relations of low-dimensional topology with graph theory (57M15) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges ⋮ Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes ⋮ Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices ⋮ The bipanconnectivity of bipartite hypercube-like networks ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ Embedding long cycles in faulty \(k\)-ary \(2\)-cubes ⋮ Vertex-fault-tolerant cycles embedding on enhanced hypercube networks ⋮ Cycles embedding on folded hypercubes with faulty nodes ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Cycles embedding in folded hypercubes under the conditional fault model ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Some results on topological properties of folded hypercubes ⋮ Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ Conditional matching preclusion sets ⋮ Edge-fault-tolerant bipanconnectivity of hypercubes ⋮ Fault-tolerant cycles embedding in folded hypercubes ⋮ Paired many-to-many disjoint path covers of hypercubes with faulty edges ⋮ Cycles passing through a prescribed path in a hypercube with faulty edges ⋮ Survey on path and cycle embedding in some networks ⋮ Vertex-disjoint paths joining adjacent vertices in faulty hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• Longest fault-free paths in hypercubes with vertex faults
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Panconnectivity of locally twisted cubes
• Cycles in folded hypercubes
• Cycle embedding in star graphs with edge faults
• Distributed fault-tolerant ring embedding and reconfiguration in hypercubes