Conditional edge-fault Hamiltonicity of augmented cubes

DOI10.1016/J.INS.2010.03.005zbMATH Open1209.68375OpenAlexW2092791908MaRDI QIDQ985082FDOQ985082

Authors: Sun-Yuan Hsieh, Yi-Ru Cian 

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

Recommendations

• Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
• Conditional edge-fault pancyclicity of augmented cubes
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• scientific article; zbMATH DE number 6139910
• Edge-fault-tolerant vertex-pancyclicity of augmented cubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Hamiltonian cycles in hypercubes with faulty edges

zbMATH Keywords

Hamiltonian cyclesHamiltonicitygraph-theoretic interconnection networksfault-tolerant embeddingaugmented cubes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (38)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985082)