Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
From MaRDI portal
Publication:878678
DOI10.1016/j.jpdc.2005.10.004zbMath1115.68032OpenAlexW2149829263MaRDI QIDQ878678
Lih-Hsing Hsu, Jimmy J. M. Tan, Ming-Chien Yang
Publication date: 26 April 2007
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.10.004
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Hamiltonian cycle embedding for fault tolerance in balanced hypercubes ⋮ A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Cycle embedding in star graphs with conditional edge faults ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes ⋮ Bipanconnectivity of balanced hypercubes ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Embedding long cycles in faulty \(k\)-ary \(2\)-cubes ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ K-restricted edge connectivity for some interconnection networks ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ Fault-tolerant Hamiltonian connectedness of cycle composition networks ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Path embedding in star graphs ⋮ Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges ⋮ Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Survey on path and cycle embedding in some networks ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Structure fault tolerance of \(k\)-ary \(n\)-cube networks ⋮ Matching preclusion for \(n\)-dimensional torus networks
