Edge-pancyclicity and path-embeddability of bijective connection graphs

Information Sciences

Volumn 178, Issue 2, 2008, Pages 340-351

  Fan, Jianxi ^a   Jia, Xiaohua ^b  

^a QINGDAO UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bijective connection graph; Crossed cube; Dilation; Edge pancyclicity; Graph embedding; M bius cube; Parallel computing system; Path

Indexed keywords

BOUNDARY CONDITIONS; EMBEDDED SYSTEMS; PARALLEL PROCESSING SYSTEMS;

BIJECTIVE CONNECTION GRAPHS; EDGE PANCYCLICITY; GRAPH EMBEDDING;

GRAPH THEORY;

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

References (30)

1. Auletta L., Rescigno A.A., and Scarano V. Embedding graphs onto the supercube. IEEE Trans. Computers 44 4 (1995) 593-597
2. Bezrukov S.L., Chavez J.D., Harper L.H., et al. The congestion of n-cube layout on a rectangular grid. Discrete Math. 213 1-3 (2000) 13-19
3. Chang C.-P., Sung T.-Y., and Hsu L.-H. Edge congestion and topological properties of crossed cubes. IEEE Trans. Parallel Distrib. Syst. 11 1 (2000) 64-80
4. Chang G.Y., Chen G.H., and Chang G.J. (t, k)-diagnosis for matching composition networks. IEEE Trans. Computers 55 1 (2006) 88-92
5. Cull P., and Larson S.M. The Möobius cubes. IEEE Trans. Computers 44 5 (1995) 647-659
6. V. Chaudhary, J.K. Aggarwal, Generalized mapping of parallel algorithms onto parallel architectures, in: Proc. Int'l. Conf. Parallel Processing, August 1990, pp. 137-141.
7. Datta A., Soundaralakshmi S., and Owens R. Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans. Parallel Distrib. Syst. 13 3 (2002) 212-222
8. M. Dietzfelbinger, The linear-array problem in communication complexity resolved, in: Proc. of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 373-382.
9. Efe K. A variation on the hypercube with lower diameter. IEEE Trans. Computers 40 11 (1991) 1312-1316
10. Fan J., and He L. BC interconnection networks and their properties. Chinese J. Computers 26 1 (2003) 84-90
11. Fan J., and Lin X. The t/k-diagnosability of the BC graphs. IEEE Trans. Computers 54 2 (2005) 176-184
12. Fan J., Lin X., and Jia X. Optimal path embedding in crossed cubes. IEEE Trans. Parallel Distrib. Syst. 16 12 (2005) 1190-1200
13. Fan J., Lin X., and Jia X. Node-pancyclicity and edge-pancyclicity of crossed cubes. Inform. Process. Lett. 93 (2005) 133-138
14. Fan J., Jia X., and Lin X. Complete path embeddings in crossed cubes. Inform. Sci. 176 (2006) 3332-3346
15. Fu J.-S. Hamiltonicity of the WK-recursive network with and without faulty nodes. IEEE Trans. Parallel Distrib. Syst. 16 9 (2005) 853-865
16. Hsu H.-C., Li T.-K., Tan J.J.M., and Hsu L.-H. Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs. IEEE Trans. Computers 53 1 (2004) 39-53
17. Huang W.-T., Chuang Y.-C., Tan J.M., and Hsu L.-H. On the fault-tolerant Hamiltonicity of faulty crossed cubes. IEICE Trans. Fundam. E85-A 6 (2002) 1359-1370
18. Kulasinghe P., and Bettayeb S. Embedding binary trees into crossed cubes. IEEE Trans. Computers 44 7 (1995) 923-929
19. Lai P.L., Tan J.J.M., Tsai C.H., et al. The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Trans. Computers 53 8 (2004) 1064-1069
20. Lin Y.-C. On balancing sorting on a linear array. IEEE Trans. Parallel Distrib. Syst. 4 5 (1993) 566-571
21. Nisan N., and Wigderson A. On rank versus communication complexity. Combinatorica 15 (1995) 557-565
22. Parhami B., and Kwai D.-M. Data-driven control scheme for linear arrays: application to a stable insertion sorter. IEEE Trans. Parallel Distrib. Syst. 10 1 (1999) 23-28
23. Park J., Kim H., and Lim H. Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IEEE Trans. Parallel Distrib. Syst. 17 3 (2006) 227-240
24. Tiwari P. Lower bounds on communication complexity in distributed computer networks. J. Assoc. Comput. Mach. 34 (1987) 921-938
25. Wagh M., and Guzide O. Mapping cycles and trees on wrap-around butterfly graphs. SIAM J. Comput. 35 3 (2006) 741-765
26. Xu J.M., Ma M.J., and Lu M. Paths in Möbius cubes and crossed cubes. Inform. Process. Lett. 97 3 (2006) 94-97
27. Xu M., and Xu J.M. Edge-pancyclicity of Möbius cubes. Inform. Process. Lett. 96 4 (2005) 136-140
28. Yang M.C., Li T.K., Tan J.J.M., et al. Fault-tolerant cycle-embedding of crossed cubes. Inform. Process. Lett. 88 4 (2003) 149-154
29. Yang M.C., Li T.K., Tan J.J.M., et al. Fault-tolerant pancyclicity of the Möbius cubes. IEICE Trans. Fundam. Electron. Commun. Computer Sci. E88A 1 (2005) 346-352
30. Yang P.-J., Tien S.-B., and Raghavendra C.S. Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Trans. Computers 43 5 (1994) 608-613