https://scholars.lib.ntu.edu.tw/handle/123456789/337560
Title: | Finding cycles in hierarchical hypercube networks | Authors: | Wu, Ruei-Yu Fu, Jung-Sheng Chang, Gerard J. GERARD JENNHWA CHANG Chen, Gen-Huey |
Keywords: | Embedding; Gray code; Hamiltonian cycle; Hierarchical hypercube network; Interconnection networks | Issue Date: | 2008 | Journal Volume: | 109 | Journal Issue: | 2 | Start page/Pages: | 112-115 | Source: | Information Processing Letters | 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. © 2008 Elsevier B.V. All rights reserved. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-56049093650&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/337560 |
DOI: | 10.1016/j.ipl.2008.09.007 | SDG/Keyword: | Computer networks; Graph theory; Hamiltonians; Hypercube networks; Bipancyclic; Bipartite graphs; Embedding; Gray code; Hamiltonian cycle; Hierarchical hypercube network; Hierarchical hypercube networks; Hypercube; Multiprocessor systems; Parallel processing systems |
Appears in Collections: | 數學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.