Embedding Hamiltonian paths in k-ary n-cubes with conditional edge faults
DOI10.1016/J.TCS.2011.02.030zbMATH Open1228.68013OpenAlexW2043424957MaRDI QIDQ650889FDOQ650889
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.030
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07)
Cites Work
- Title not available (Why is that?)
- Edge-bipancyclicity of conditional faulty hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Linear array and ring embeddings in conditional faulty hypercubes
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Cycle embedding in star graphs with conditional edge faults
Cited In (8)
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Conditional edge-fault Hamiltonicity of augmented cubes
- Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
- Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
- Hamiltonian properties of honeycomb meshes
- Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
- Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes
- Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
This page was built for publication: Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650889)
