Algorithmic construction of Hamiltonians in pyramids

The hierarchical nature and rich connectivity of the pyramid network have made it a desirable topology as both a hardware architecture and software structure to solve a number of important parallel applications, for example, in image processing and machine vision. Embedding of Hamiltonian path/cycle in a host network is of great importance in network graphs and has been widely studied in the past. This paper addresses the problem of embedding Hamiltonian paths/cycles in the pyramid network.