Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
From MaRDI portal
Publication:955008
DOI10.1016/j.tcs.2008.06.024zbMath1154.68034OpenAlexW2006863071MaRDI QIDQ955008
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.024
hypercubeHamiltonian cycleinterconnection networkfault-tolerant embeddingtwisted cubeconditional edge fault
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Paths and cycles identifying vertices in twisted cubes, Constructing edge-disjoint spanning trees in twisted cubes, Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks, Conditional edge-fault-tolerant Hamiltonicity of the data center network, Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs, Conditional edge-fault pancyclicity of augmented cubes, Conditional edge-fault-tolerant Hamiltonicity of dual-cubes, Pancyclicity of ternary \(n\)-cube networks under the conditional fault model, Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes, Vertex-pancyclicity of twisted cubes with maximal faulty edges, Fault-tolerant embedding of meshes/tori in twisted cubes, Fault-free Hamiltonian cycles in twisted cubes with conditional link faults, Fault tolerance in \(k\)-ary \(n\)-cube networks, Conditional fault Hamiltonicity of the complete graph, Hamiltonian properties of twisted hypercube-like networks with more faulty elements, 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, \(\omega \)-wide diameters of enhanced pyramid networks, Two-node-Hamiltonicity of enhanced pyramid networks, Conditional edge-fault Hamiltonicity of augmented cubes, Edge-fault-tolerant node-pancyclicity of twisted cubes, Pancyclicity and bipancyclicity of conditional faulty folded hypercubes, Hamiltonian cycles in hypercubes with more faulty edges, Fault tolerance in bubble-sort graph networks, Fault-tolerant panconnectivity of augmented cubes, Survey on path and cycle embedding in some networks, Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model, Hamiltonicity of the Torus Network Under the Conditional Fault Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant cycle embedding in the hypercube
- Fault-tolerant Hamiltonicity of twisted cubes
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Topological properties of twisted cube
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- On embedding cycles into faulty twisted cubes
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Efficient Gossiping by Packets in Networks with Random Faults