Abstract: Lee distance Gray codes for k-ary n-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to ...
Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint. Hamiltonian cycles for a class of &-ary r-cubes, 2-D tori, and ...
Lee distance Gray codes for k-ary n-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly ...
Lee distance Gray codes for k-ary n-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly ...
Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles.
www.researchgate.net › publication › 22...
Lee distance Gray codes are shown to be useful in edge disjoint decomposition of higher dimensional torus to lower dimensional tori, particularly edge ...
People also ask
What is the Hamiltonian cycle in Gray code?
What are edge disjoint Hamiltonian cycles?
How many edge disjoint Hamiltonian cycles are there in K7?
We first construct three edge-disjoint Hamiltonian cycles in 4-dimensional transposition network. By using the concept of gray code, we construct three edge ...
Lee distance Gray codes over Z<sub>k</sub><sup>n</sup> are designed and then it is shown how these codes can be used to generate edge disjoint Hamiltonian ...
Mar 24, 2023 · Myung M. Bae, Bella Bose: Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles. IPDPS 2000: 365-370. manage site settings.
This section contains the functions that generate these disjoint cycles for the 2D torus. Two Gray codes, G1 and G2, over Zn k are said to be independent if two ...
Such independent Gray codes corresponds to edge disjoint Hamiltonian cycles on the Torus graph T[supserscript n][subscript k] and multidimensional Gaussian ...