摘要： This paper introduces theoretical and practical study on embedding Hamiltonian cycle in the Extended OTIS- n -Cube. A generalized Algorithm is also presented for embedding Hamiltonian cycle in the Extended OTIS-n -Cube. The recently proposed network has many good topological features such as regular degree, semantic structure, low diameter, and ability to embed graphs and cycles. Embedding Hamiltonian cycle is an important characteristic for any topology due to the usefulness of undertaking different types of broadcasting messages within interconnection networks. The proposed algorithm is capable to form a Hamiltonian cycle starting from any node in the network. Examples are presented on different network sizes showing complete paths of Hamiltonian cycles.
Loading...
