✦ LIBER ✦

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

✍ Scribed by Bae, M.M.; Bose, B.

Book ID: 118697712
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 580 KB
Volume: 52
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.2003.1234525

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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__

Panconnectivity and edge-pancyclicity of

Panconnectivity and edge-pancyclicity of k-ary n-cubes

✍ Sun-Yuan Hsieh; Tsong-Jie Lin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

Fault-Tolerant Embeddings of Hamiltonian

Fault-Tolerant Embeddings of Hamiltonian Circuits in k -ary n -Cubes

✍ Ashir, Yaagoub A.; Stewart, Iain A. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 217 KB

Edge-disjoint paths and cycles in n-edge

Edge-disjoint paths and cycles in n-edge-connected graphs

✍ Andreas Huck 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l ≥ 0 let g(k, l) be the minimal __n__ ≥ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a

Data Rearrangement between Radix-k and L

Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes

✍ Myung M. Bae; R. Venkatesan; Bella Bose 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 150 KB

The k-ary n-cube is one of the popular topologies for interconnecting processors in multicomputers. This paper studies the difference in communication requirements between two Lee distance Gray codes when moving data from processors in normal radix k order to those in Gray code order in k-ary n-cube

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