Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks

DOI10.1016/j.ic.2016.10.002zbMath1353.68011OpenAlexW2537806258MaRDI QIDQ342731

Sun-Yuan Hsieh, Chien-Hsiang Huang, Chia-Wei Lee

Publication date: 18 November 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.10.002

zbMATH Keywords

graph theoryinterconnection networksmultiprocessor systemsconditional edge faultsHamiltonian connectivityrestricted hypercube-like networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model ⋮ Communication Performance Evaluation of the Locally Twisted Cube

Cites Work

• Unnamed Item
• Unnamed Item
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Fault-tolerant cycle embedding in the hypercube
• Edge-bipancyclicity of star graphs with faulty elements
• On the generalized twisted cube
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Conditional fault hamiltonian connectivity of the complete graph
• Recursive circulants and their embeddings among hypercubes
• Linear array and ring embeddings in conditional faulty hypercubes
• A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
• Circulants and their connectivities
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• The Mobius cubes
• The locally twisted cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Pancyclicity of Matching Composition Networks under the Conditional Fault Model
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

This page was built for publication: Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks