Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even

DOI10.1016/J.COMPELECENG.2011.01.008MaRDI QIDQ553845zbMATH OpenOpenAlexFDO

Authors Hsun Su, Jing-Ling Pan, Shin-Shin Kao

Publication date 28 July 2011

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

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

zbMATH Keywords

hypercubeinterconnection networks\(k\)-ary \(n\)-cube networkmutually independent Hamiltonian cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
• Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
• On the mutually independent Hamiltonian cycles in faulty hypercubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Hamiltonian cycles passing through linear forests in k-ary n-cubes

Cited in

(2)

• Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
• On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube

This page was built for publication: Mutually independent Hamiltonian cycles in \(k\)-ary \(n\)-cubes when \(k\) is even

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