Embedding long cycles in faulty \(k\)-ary \(2\)-cubes

DOI10.1016/j.amc.2011.11.026zbMath1238.68031OpenAlexW2111865651MaRDI QIDQ426579

Kai Feng, Shurong Zhang, Jing Li, Shi-ying Wang

Publication date: 11 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.11.026

zbMATH Keywords

torusfault-tolerance\(k\)-ary \(2\)-cubescycle embeddings

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges ⋮ Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle

Cites Work

• Unnamed Item
• Path embeddings in faulty 3-ary \(n\)-cubes
• Cycles embedding in hypercubes with node failures
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Cycle embedding of augmented cubes
• Path embedding in faulty hypercubes
• The bipancycle-connectivity of the hypercube
• Fault-tolerant cycle-embedding in alternating group graphs
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

This page was built for publication: Embedding long cycles in faulty \(k\)-ary \(2\)-cubes