The m-pancycle-connectivity of a WK-Recursive network

Information Sciences

Volumn 177, Issue 24, 2007, Pages 5611-5619

  Fang, Jywe Fei ^a   Wang, Yuh Rau ^b   Huang, Hui Ling ^c  

^a NATIONAL TAICHUNG UNIVERSITY OF EDUCATION   (Taiwan)

^b ST JOHN'S UNIVERSITY   (Taiwan)

^c SOUTHERN TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Interconnection networks; m Pancycle connectivity; WK recursive networks

Indexed keywords

INFORMATION SCIENCE; PROBLEM SOLVING;

M-PANCYCLE-CONNECTIVITY; WK-RECURSIVE NETWORK;

INTERCONNECTION NETWORKS;

EID: 34648854446     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.04.013     Document Type: Article

References (25)

1. Alspach B., and Hare D. Edge-pancyclic block-intersection graphs. Discr. Math. 97 1-3 (1991) 17-24
2. Araki T., and Shibata Y. Pancyclicity of recursive circulant graphs. Inform. Process. Lett. 81 4 (2002) 187-190
3. Auletta A., Rescigno A., and Scarano V. Embedding graphs onto the supercube. IEEE Trans. Comput. 44 4 (1995) 593-597
4. Bae M.M. Resource placement in torus-based networks. IEEE Trans. Comput. 46 10 (1997) 1083-1092
5. Chang H.Y., and Chen R.J. Embedding cycles in IEH graphs. Inform. Process. Lett. 64 (1997) 23-27
6. Chang J.M., Yang J.S., Yang J.S., Wang Y.L., and Cheng Y. Pan-connectivity, fault-tolerant hamiltonicity and Hamiltonian-connectivity in alternating group graphs. Networks 44 4 (2004) 302-310
7. Chartrand G., and Oellermann O.R. Applied and Algorithmic Graph Theory (1993), McGraw-Hill, New York
8. Chen H.L., and Tzeng N.F. Efficient resource placement in hypercubes using multiple-adjacency codes. IEEE Trans. Comput. 43 1 (1994) 23-33
9. Fan J., Jia X., and Lin X. Complete path embedings in crossed cubes. Inform. Sci. 176 22 (2006) 3332-3346
10. J.F. Fang, G.J. Lai, Y.C. Liu, S.T. Fang. A novel broadcasting scheme for WK-recursive networks, in: Proceedings of the 2003 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2, 2003, pp. 1028-1031.
11. R. Fernandes, D.K. Friesen, A. Kanevsky. Embedding rings in recursive networks, in: Proceedings of the International Parallel Processing Symposium, 1994, pp. 273-280.
12. Hobbs A. The square of a block is vertex-pancyclic. J. Combin. Theory Ser. B 20 1 (1976) 1-4
13. Huang K., and Wu J. Fault-tolerant resource placement in balanced hypercubes. Inform. Sci. 99 3-4 (1997) 159-172
14. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Mogran Kaufmann, California
15. Li T.K., Tan J.J.M., and Hsu L.H. Hyper hamiltonian laceability on edge fault star graph. Inform. Sci. 165 1-2 (2004) 59-71
16. Lin Y.C. On balancing sorting on a linear array. IEEE Trans. Parallel. Distr. Syst. 4 5 (1993) 566-571
17. A.I. Mahdaly, H.T. Mouftah, N.N. Hanna, Topological properties of WK-recursive networks, in: Proceeding of the Second IEEE Workshop on Future Trends of Distributed Computing Systems, 1990, pp. 374-380.
18. O'Hallaron D.R. Uniform approach for solving some classical problems on a linear array. IEEE Trans. Parallel Distr. Syst. 2 2 (1991) 236-241
19. Park C.D., and Chwa K.Y. Hamiltonian properties on the class of hypercube-like networks. Inform. Process. Lett. 91 1 (2004) 11-17
20. Peters C., and Volkmann L. Vertex 6-pancyclic in-tournaments. Discr. Math. 285 1-3 (2004) 227-238
21. Ucar B., Aykanat C., Kaya K., and Ikinci M. Task, assignment in heterogeneous computing systems. J. Parallel Distr. Comput. 66 1 (2006) 32-46
22. G.D. Vecchia, C. Sanges. Recursively scalable network for message passing architecture, in: Proceeding of the International Conference Parallel Processing and Applications, 1, 1987, pp. 33-40.
23. Vecchia G.D., and Sanges C. A recursively scalable network VLSI implementation. Future Generat. Comput. Syst. 4 3 (1988) 235-243
24. Vecchia G.D., and Sanges C. An optimal broadcasting technique for WK-Recursive topologies. Future Generat. Comput. Syst. 5 4 (1989/90) 353-357
25. Yang M.C., Li T.K., Tan J.J.M., and Hsu L.H. On embedding cycles into faulty twisted cubes. Inform. Sci. 176 6 (2006) 676-690