Hamiltonian Path in Generalized Hierarchical Completely-Connected Networks

摘要

Generalized Hierarchical Completely-Connected Networks (for short, HCC), which include conventional hierarchical networks, have been proposed by the authors. Since the HCC include many hierarchical networks, it is called generalized one. The HCC are as network topologies for a massively parallel computer system. To apply the HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in HCC must be revealed. In this paper, node-disjoint paths are verified for a level block of the HCC. Furthermore, we demonstrate to construct a Hamiltonian path in the HCC. The results show that those properties are useful for applications such as data communications among processors in the systems.