Classification of the Hamiltonian cycles in binary hypercubes

DOI10.1023/A:1010257922257MaRDI QIDQ1778472zbMATH OpenOpenAlexFDO

Authors P. P. Parkhomenko

Publication date 17 June 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010257922257

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Towards a classification of Hamiltonian cycles in the 6-cube
• scientific article; zbMATH DE number 790411
• scientific article; zbMATH DE number 5239125
• Construction of maximum cycles in faulty binary hypercubes
• scientific article; zbMATH DE number 1743965

Cited in

(10)

• Finding Lean Induced Cycles in Binary Hypercubes
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• Construction of maximum cycles in faulty binary hypercubes
• scientific article; zbMATH DE number 5239125 (Why is no real title available?)
• Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
• scientific article; zbMATH DE number 790411 (Why is no real title available?)
• Towards a classification of Hamiltonian cycles in the 6-cube
• Shaped lattice graphs as models of the multiprocessor computer systems
• Modifying the tolerant substitution method in almost uniform compact surveys
• Construction of Hamiltonian circuits in Cayley graphs modeling multiprocessing computer systems

This page was built for publication: Classification of the Hamiltonian cycles in binary hypercubes

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