| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427890 | Information Processing Letters | 2008 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
