Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Pancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network

Fu, J.-S. and Chen, G.-H.

    We show that the hierarchical cubic network, an alternative to the hypercube, is hamiltonian-connected using Gray codes. A network is hamiltonian-connected if it contains a hamiltonian path between every two distinct nodes. In other words, a hamil-tonian-connected network can embed a longest linear array be-tween every two distinct nodes with dilation, congestion, load, and expansion equal to one. We also show that the hierarchical cubic network contains cycles of all possible lengths but three and five. Since the hypercube contains cycles only of even lengths, it is concluded that the hierarchical cubic network is superior to the hypercube in hamiltonicity. Our results can be applied to the hierarchical folded-hypercube network as well.
Cite as: Fu, J.-S. and Chen, G.-H. (2002). Pancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network. In Proc. Seventh Asia-Pacific Computer Systems Architectures Conference (ACSAC2002), Melbourne, Australia. CRPIT, 6. Lai, F. and Morris, J., Eds. ACS. 7-16.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007