Strongly Hamiltonian laceability of the even k-ary n-cube

DOI10.1016/J.COMPELECENG.2009.01.002zbMATH Open1187.68109OpenAlexW2021931567MaRDI QIDQ733293FDOQ733293

Authors: Chien-Hung Huang 

Publication date: 15 October 2009

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2009.01.002

Recommendations

• Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes

zbMATH Keywords

\(k\)-ary \(n\)-cubeinterconnection networksstrongly Hamiltonian laceability

Mathematics Subject Classification ID

Computer system organization (68M99)

Cited In (8)

• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
• Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
• Paired many-to-many disjoint path covers of hypertori
• Hamiltonian-laceability of star graphs
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes

This page was built for publication: Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733293)