Hamiltonian properties of twisted hypercube-like networks with more faulty elements

DOI10.1016/j.tcs.2011.01.034zbMath1216.68059OpenAlexW2083455578MaRDI QIDQ533889

Erjie Yang, Qiang Dong, Jianqiu Cao, Xiaofan Yang

Publication date: 10 May 2011

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

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

zbMATH Keywords

fault toleranceHamiltonian cycleinterconnection networksnear Hamiltonian cycletwisted hypercube-like network

Mathematics Subject Classification ID

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

Related Items (4)

Super spanning connectivity on WK-recursive networks ⋮ One-to-one disjoint path covers on alternating group graphs ⋮ Independent spanning trees on twisted cubes ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding a long fault-free cycle in a crossed cube with more faulty nodes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Strong Menger connectivity with conditional faults on the class of hypercube-like networks
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Minimum neighborhood in a generalized cube
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Hamiltonian properties on the class of hypercube-like networks
• The Mobius cubes
• The locally twisted cubes
• Hamiltonian-laceability of star graphs
• Embedded paths and cycles in faulty hypercubes

This page was built for publication: Hamiltonian properties of twisted hypercube-like networks with more faulty elements