Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
From MaRDI portal
Publication:4785687
DOI10.1137/S0895480196311183zbMath1018.68058MaRDI QIDQ4785687
Iain A. Stewart, Yaagoub A. Ashir
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (36)
A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links ⋮ Fault-tolerant pancyclicity of augmented cubes ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Pancyclicity of ternary \(n\)-cube networks under the conditional fault model ⋮ Embedding long cycles in faulty \(k\)-ary \(2\)-cubes ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults ⋮ Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ 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 paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Edge‐fault‐tolerant pancyclicity of alternating group graphs ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Survey on path and cycle embedding in some networks ⋮ Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks
This page was built for publication: Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
