Finding cycles in hierarchical hypercube networks
Resource
Information Processing Letters 109 (2): 112-115
Journal
Information Processing Letters
Journal Volume
109
Journal Issue
2
Pages
112-115
Date Issued
2008
Author(s)
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.
Subjects
Embedding; Gray code; Hamiltonian cycle; Hierarchical hypercube network; Interconnection networks
Other Subjects
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
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
07.pdf
Size
24.16 KB
Format
Adobe PDF
Checksum
(MD5):27671d61dbabe7cd6825379c042a83a8