Long paths in hypercubes with conditional node-faults

DOI10.1016/j.ins.2008.10.015zbMath1170.68001OpenAlexW2002931942MaRDI QIDQ1010144

Tz-Liang Kueng, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu

Publication date: 3 April 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.10.015

zbMATH Keywords

hypercubefault toleranceinterconnection networkpath embeddinglinear arrayconditional fault

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (29)

Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ Long cycles in hypercubes with optimal number of faulty vertices ⋮ Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ Fault-tolerant cycle embedding in the faulty hypercubes ⋮ Hamiltonian cycles in hypercubes with faulty edges ⋮ Cycles embedding in folded hypercubes with conditionally faulty vertices ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ The triangular pyramid: Routing and topological properties ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ The panpositionable panconnectedness of augmented cubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Long paths in hypercubes with a quadratic number of faults ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Paired many-to-many disjoint path covers of hypercubes with faulty edges ⋮ Survey on path and cycle embedding in some networks ⋮ Hamiltonian properties on a class of circulant interconnection networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Longest fault-free paths in hypercubes with vertex faults
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Embedding meshes into crossed cubes
• Node-disjoint paths in hierarchical hypercube networks
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• On embedding cycles into faulty twisted cubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Hamiltonian-laceability of star graphs

This page was built for publication: Long paths in hypercubes with conditional node-faults