✦ LIBER ✦

Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes

✍ Scribed by Hussain, Zaid A.; Bose, Bella; Al-Dhelaan, Abdullah

Book ID: 121716444
Publisher: IEEE
Year: 2014
Tongue: English
Weight: 721 KB
Volume: 63
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.2012.192

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge disjoint Hamiltonian cycles in k-ar

Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes

✍ Bae, M.M.; Bose, B. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 580 KB

Edge-disjoint Hamiltonian cycles in hype

Edge-disjoint Hamiltonian cycles in hypertournaments

✍ Vojislav Petrovic; Carsten Thomassen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB

## Abstract We introduce a method for reducing __k__‐tournament problems, for __k__ ≥ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a __k__‐tournament on __n__ ≥ k + 1 + 24__d__ vertices (when __k__ ≥ 4) or on __n__ ≥ 30__d__ + 2 vertices (when __k__ = 3) has __d__

Random partitions and edge-disjoint Hami

Random partitions and edge-disjoint Hamiltonian cycles

✍ Hartke, Stephen G.; Seacrest, Tyler 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Edge-Disjoint Hamiltonian Paths and Cycl

Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

✍ Thomassen, C. 📂 Article 📅 1982 🏛 Oxford University Press 🌐 English ⚖ 445 KB

Determination of Hamiltonian cycles in c

Determination of Hamiltonian cycles in cube-based networks using generalized Gray Codes

✍ Shahram Latifi; Si-Qing Zheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1000 KB

Hamiltonian cycles and paths with a pres

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

✍ Rostislav Caha; V. Koubek 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract This paper studies techniques of finding hamiltonian paths and cycles in hypercubes and dense sets of hypercubes. This problem is, in general, easily solvable but here the problem was modified by the requirement that a set of edges has to be used in such path or cycle. The main result o