Wu, Ruei-YuRuei-YuWuFu, Jung-ShengJung-ShengFuChang, Gerard J.Gerard J.ChangGERARD JENNHWA CHANGChen, Gen-HueyGen-HueyChen2018-09-102018-09-102008http://www.scopus.com/inward/record.url?eid=2-s2.0-56049093650&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/337560The 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.application/pdf174042 bytesapplication/pdfEmbedding; Gray code; Hamiltonian cycle; Hierarchical hypercube network; Interconnection networksComputer 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 systemsjournal article10.1016/j.ipl.2008.09.0072-s2.0-56049093650