|
|||||
|
|
Finding cycles in hierarchical hypercube networks |
|
| Authors: | Ruei-Yu Wu Gen-Huey Chen Jung-Sheng Fu |
| Affiliation: | a Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan b Department of Electronic Engineering, National United University, Miaoli, Taiwan c Department of Mathematics, National Taiwan University, Taipei, Taiwan d Department of Management Information Systems, Hwa Hsia Institute of Technology, Taipei, Taiwan |
| Abstract: | The hierarchical hypercube network, which was proposed as an alternative to the hypercube, is suitable for building a large-scale multiprocessor system. A bipartite graph G=(V,E) is bipancyclic if it contains cycles of all even lengths ranging from 4 to |V|. In this paper, we show that the hierarchical hypercube network is bipancyclic. |
| Keywords: | Embedding Gray code Hamiltonian cycle Hierarchical hypercube network Interconnection networks |
| 本文献已被 ScienceDirect 等数据库收录！ | |