Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube

DOI10.1016/j.compeleceng.2009.01.002zbMath1187.68109OpenAlexW2021931567MaRDI QIDQ733293

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

zbMATH Keywords

interconnection networks\(k\)-ary \(n\)-cubestrongly Hamiltonian laceability

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (7)

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

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