Strongly Hamiltonian laceability of the even k-ary n-cube

Computers and Electrical Engineering

Volumn 35, Issue 5, 2009, Pages 659-663

  Huang, Chien Hung ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

Interconnection networks; k ary n cube; Strongly Hamiltonian laceability

Indexed keywords

BIPARTITE GRAPHS; HAMILTONIAN LACEABILITY; HAMILTONIAN LACEABLE; HAMILTONIAN PATH; HYPERCUBE; K-ARY N-CUBE; K-ARY N-CUBES; PARTITE SETS; STRONGLY HAMILTONIAN LACEABILITY;

GEOMETRY; GRAPH THEORY; INTERCONNECTION NETWORKS; JOINING; MEATS;

HAMILTONIANS;

EID: 67849122310     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compeleceng.2009.01.002     Document Type: Article

References (16)

1. Ashir Y., Stewart I.A., and Ahmed A. Communication algorithms in k-ary n-cube interconnection networks. Inf Process Lett 61 1 (1997) 43-48
2. Bae M.M. Resource placement in torus-based networks. IEEE Trans Comput 46 10 (1997) 1083-1092
3. Bose B., Broeg B., Kwon Y., and Ashir Y. Lee distance and topological properties of k-ary n-cubes. IEEE Trans Comput (1995) 1021-1030
4. Chang J.M., Yang J.S., Wang Y.L., and Cheng Y. Panconnectivity, fault-tolerant Hamiltonicity and Hamiltonian-connectivity in alternating group graphs. Networks 44 4 (2004) 302-310
5. Chen H.L., and Tzeng N.F. Efficient resource placement in hypercubes using multiple-adjacency codes. IEEE Trans Comput 43 1 (1994) 23-33
6. Fan J., Jia X., and Lin X. Complete path embeddings in crossed cubes. Inf Sci 176 22 (2006) 3332-3346
7. Fang J.F. The bipanconnectivity and m-panconnectivity of the folded hypercube. Theor Comput Sci 385 1-3 (2007) 286-300
8. Fang J.F., Wang Y.R., and Huang H.L. The m-pancycle connectivity of a WK-recursive network. Inf Sci 177 24 (2007) 5611-5619
9. Leighton F.T. Introduction to parallel algorithms and architectures: arrays, trees, hypercubes (1992), Morgan Kaufmann, California
10. Lin Y.C. On balancing sorting on a linear array. IEEE Trans Parallel and Distributed Systems 4 5 (1993) 566-571
11. O'Hallaron D.R. Uniform approach for solving some classical problems on a linear array. IEEE Trans Parallel Distributed Sys 2 2 (1991) 236-241
12. Park C.D., and Chwa K.Y. Hamiltonian properties on the class of hypercube-like networks. Inf Process Lett 91 1 (2004) 11-17
13. Wang D, An T, Pan M, Wang K, Qu S. Hamiltonian-like properties of k-ary n-cubes. In: Proceedings of international conference on parallel and distributed computing, Applications and Technologies; 2005. pp. 1002-7.
14. Wong S.A. Hamiltonian cycles and paths in butterfly graphs. Networks 26 (1995) 145-150
15. Xu J.M., and Ma M. Cycles in folded hypercubes. Appl Math Lett 19 2 (2006) 140-145
16. Yang M.C., Tan J.J.M., and Hsu L.H. Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. J Parallel Distributed Comput 67 4 (2007) 362-368