Record Details
On edge disjoint Hamiltonian cycles in torus and Gaussian networks
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | On edge disjoint Hamiltonian cycles in torus and Gaussian networks |
| Names |
Alazemi, Fawaz M.
(creator) Bose, Bella (advisor) |
| Date Issued | 2014-12-04 (iso8601) |
| Note | Graduation date: 2015 |
| Abstract | Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis, we present a recurrence function that can generate 2[superscript r] ≥ 1 independent Gray codes from Z[supserscript n][subscript k] where 2[superscript r] ≤ n < 2[superscript r+1]. Such independent Gray codes corresponds to edge disjoint Hamiltonian cycles on the Torus graph T[supserscript n][subscript k] and multidimensional Gaussian network Gα[superscript ⌊n/2⌋], for 1 ≤ 2[superscript r] ≤ n < 2[superscript r+1]. |
| Genre | Thesis/Dissertation |
| Topic | Torus |
| Identifier | http://hdl.handle.net/1957/54654 |
