Conditional edge-fault Hamiltonicity of augmented cubes

DOI10.1016/j.ins.2010.03.005zbMath1209.68375OpenAlexW2092791908MaRDI QIDQ985082

Yi-Ru Cian, Sun-Yuan Hsieh

Publication date: 20 July 2010

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

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

zbMATH Keywords

Hamiltonian cyclesHamiltonicityfault-tolerant embeddinggraph-theoretic interconnection networksaugmented cubes

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) Eulerian and Hamiltonian graphs (05C45)

Related Items (33)

Constructing edge-disjoint spanning trees in twisted cubes ⋮ Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ Strong matching preclusion for augmented cubes ⋮ Conditional edge-fault pancyclicity of augmented cubes ⋮ Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes ⋮ Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes ⋮ Bipanconnectivity of balanced hypercubes ⋮ Hamiltonian cycles of balanced hypercube with more faulty edges ⋮ Regular connected bipancyclic spanning subgraphs of hypercubes ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Fault tolerance in the arrangement graphs ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks ⋮ Hamiltonian properties of honeycomb meshes ⋮ The Hamiltonian properties of supergrid graphs ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ \(\omega \)-wide diameters of enhanced pyramid networks ⋮ The panpositionable panconnectedness of augmented cubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Maximally local connectivity and connected components of augmented cubes ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ Conditional fault tolerance in a class of Cayley graphs ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ An upper bound for the crossing number of augmented cubes ⋮ Hamiltonicity of the Torus Network Under the Conditional Fault Model

Cites Work

• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• Embedding longest fault-free paths onto star graphs with more vertex faults
• 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
• Path embeddings in faulty 3-ary \(n\)-cubes
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Hamiltonian laceability of bubble-sort graphs with edge faults
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• The super connectivity of augmented cubes
• Cycle embedding of augmented cubes
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• Long paths in hypercubes with conditional node-faults
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Linear array and ring embeddings in conditional faulty hypercubes
• A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
• Fault-tolerant pancyclicity of augmented cubes
• Node-disjoint paths in hierarchical hypercube networks
• Constructing the nearly shortest path in crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• A group-theoretic model for symmetric interconnection networks
• The Mobius cubes
• The locally twisted cubes
• Augmented cubes
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Conditional edge-fault Hamiltonicity of augmented cubes