Fault-free Hamiltonian cycles in crossed cubes with conditional link faults

DOI10.1016/j.ins.2007.05.032zbMath1132.68018OpenAlexW2008872160MaRDI QIDQ2465338

Hao-Shun Hung, Jung-Sheng Fu, Gen-Huey Chen

Publication date: 3 January 2008

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

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154730/1/46.pdf

zbMATH Keywords

hypercubeHamiltonian cycleinterconnection networkfault-tolerant embeddingcrossed cubeconditional link faultforbidden faulty set model

Mathematics Subject Classification ID

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

Related Items (44)

On the \(t/k\)-diagnosability of BC networks ⋮ Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Cycle embedding in star graphs with conditional edge faults ⋮ Constructing edge-disjoint spanning trees in twisted cubes ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ Pancyclicity of ternary \(n\)-cube networks under the conditional fault model ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults ⋮ Embedding a long fault-free cycle in a crossed cube with more faulty nodes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Hamiltonian properties of honeycomb meshes ⋮ Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Fault-free Hamiltonian cycles in twisted cubes with conditional link faults ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Conditional fault Hamiltonicity of the complete graph ⋮ Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges ⋮ 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 ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ An optimal result on fault-tolerant cycle-embedding in alternating group graphs ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ The conditional diagnosability of crossed cubes under the comparison model ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Path embedding in star graphs ⋮ A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ Independent spanning trees in crossed cubes ⋮ Embedding meshes/tori in faulty crossed cubes ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Survey on path and cycle embedding in some networks ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model ⋮ Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Cites Work

• Unnamed Item
• Connectivity of the crossed cube
• Longest fault-free paths in hypercubes with vertex faults
• On reliability of the folded hypercubes
• Fault-tolerant cycle-embedding of crossed cubes
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large girth
• Topological properties of the crossed cube architecture
• Linear array and ring embeddings in conditional faulty hypercubes
• Edge fault tolerance analysis of a class of interconnection networks
• Hamiltonian properties on the class of hypercube-like networks
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• On embedding cycles into faulty twisted cubes
• Complete path embeddings in crossed cubes
• Conditional connectivity
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Embedding binary trees into crossed cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Combinatorial analysis of the fault-diameter of the n-cube

This page was built for publication: Fault-free Hamiltonian cycles in crossed cubes with conditional link faults