Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
From MaRDI portal
Publication:726167
DOI10.1016/j.ins.2014.01.044zbMath1341.68139OpenAlexW1975413980MaRDI QIDQ726167
Yuxing Yang, Shurong Zhang, Shi-ying Wang
Publication date: 8 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.01.044
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (4)
The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Structure fault tolerance of \(k\)-ary \(n\)-cube networks
Cites Work
- Unnamed Item
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
- Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
- Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
- Path embeddings in faulty 3-ary \(n\)-cubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers of the hypercubes
- Panconnectivity and edge-pancyclicity ofk-aryn-cubes
- A group-theoretic model for symmetric interconnection networks
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
This page was built for publication: Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes