Cycle embedding in star graphs with conditional edge faults

Applied Mathematics and Computation

Volumn 215, Issue 10, 2010, Pages 3541-3546

  Yang, Ming Chien ^a  

^a ALETHEIA UNIVERSITY   (Taiwan)

Author keywords

Cycle; Embedding; Hamiltonian; Interconnection network; Pancyclic; Star graph

Indexed keywords

CYCLE; CYCLE EMBEDDING; EMBEDDING; PANCYCLIC; STAR GRAPHS;

HAMILTONIANS; INTERCONNECTION NETWORKS;

GRAPH THEORY;

EID: 72749115166     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.10.051     Document Type: Article

References (34)

1. Akers S.B., and Krishnamurthy B. The star graph: an attractive alternative to the n-cube. Proc. Int'l. Conf. Parallel Process. (1987) 393-400
2. Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 (1989) 555-566
3. Araki T., and Shibata Y. Pancyclicity of recursive circulant graphs. Inform. Process. Lett. 81 4 (2002) 187-190
4. Bae M.M., and Bose B. Edge disjoint hamiltonian cycles in k-ary n-cubes and hypercubes. IEEE Trans. Comput. 52 10 (2003) 1271-1284
5. Chen C.C., and Chen J. Optimal parallel routing in star networks. IEEE Trans. Comput. 46 12 (1997) 1293-1303
6. Fan J., Lin X., Pan Y., and Jia X. Optimal fault-tolerant embedding of paths in twisted cubes. J. Parallel Distribut. Comput. 67 2 (2007) 205-214
7. Fragopoulou P., and Akl S.G. Optimal communication algorithms on star graphs using spanning tree constructions. J. Parallel Distribut. Comput. 24 (1995) 55-71
8. Fu J.S. Conditional fault-tolerant hamiltonicity of star graphs. Parallel Comput. 33 (2007) 488-496
9. Hsieh S.Y. Embedding longest fault-free paths onto star graphs with more vertex faults. Theoretical Comput. Sci. 337 1-3 (2005) 370-378
10. Hsieh S.Y., Chen G.H., and Ho C.W. Hamiltonian-laceability of star graphs. Networks 36 4 (2000) 225-232
11. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with edge faults. IEEE Trans. Comput. 50 9 (2001) 960-971
12. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with vertex faults. Theoretical Comput. Sci. 262 1-2 (2001) 215-227
13. Hsieh S.Y., and Lee C.W. Conditional edge-fault Hamiltonicity of matching composition networks. IEEE Trans. Parallel Distribut. Syst. 20 4 (2009) 581-592
14. S.Y. Hsieh, C.W. Lee, Pancyclicity of restricted hypercube like networks under the conditional fault model, SIAM J. Discr. Math., in press.
15. Hsieh S.Y., and Wu C.D. Optimal fault-tolerant hamiltonicity of star graphs with conditional edge faults. J. Supercomput. 49 3 (2009) 354-372
16. S.Y. Hsieh, C.Y. Wu, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, J. Combinator. Optimiz., in press.
17. 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. Comput. 53 1 (2004) 39-53
18. Hung H.S., Fu J.S., and Chen G.H. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Inform. Sci. 177 24 (2007) 5664-5674
19. Latifi S. On the fault-diameter of the star graph. Inform. Process. Lett. 46 (1993) 143-150
20. Latifi S., Hegde M., and Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43 2 (1994) 218-222
21. Li T.K. Cycle embedding in star graphs with edge faults. Appl. Math. Comput. 167 (2005) 891-900
22. Li T.K., Tan J.M., and Hsu L.H. Hyper Hamiltonian laceability on edge fault star graph. Inform. Sci. 165 (2004) 59-71
23. Mendia V.E., and Sarlar D. Optimal broadcasting on the star graph. IEEE Trans. Parallel Distribut. Syst. 3 (1992) 389-396
24. Rouskov Y., Latifi S., and Srimani P.K. Conditional fault diameter of star graph networks. IEEE Trans. Parallel Distribut. Syst. 33 (1996) 91-97
25. Rouskov Y., and Srimani P.K. Fault diameter of star graph networks. Inform. Process. Lett. 48 (1993) 243-251
26. Rowley R.A., and Bose B. Fault-tolerant ring embedding in de-Bruijn networks. IEEE Trans. Comput. 12 (1993) 1480-1486
27. Tsai C.H. Linear array and ring embeddings in conditional faulty hypercubes. Theoretical Comput. Sci. 314 (2004) 431-443
28. Tseng Y.C., Chang S.H., and Sheu J.P. Fault-tolerant ring embedding in a star graph with both link and node failures. IEEE Trans. Parallel Distribut. Syst. 8 12 (1997) 1185-1195
29. Sheu J.P., Wu C.T., and Chen T.S. An optimal broadcasting algorithm without message redundancy in star graphs. IEEE Trans. Parallel Distribut. Syst. 6 (1995) 653-658
30. Xu J.M., Ma M., and Lü M. Paths in Möbius cubes and crossed cubes. Inform. Process. Lett. 97 3 (2006) 94-97
31. Xu M., Hu X.D., and Zhu Q. Edge-bipancyclicity of star graphs under edge fault-tolerant. Appl. Math. Comput. 183 (2006) 972-979
32. Yang M.C. Path embedding in star graphs. Appl. Math. Comput. 207 2 (2009) 283-291
33. Yang M.C., Tan J.M., and Hsu L.H. Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. J. Parallel Distribut. Comput. 67 4 (2007) 362-368
34. Yang M.C., Tan J.M., and Hsu L.H. Highly fault-tolerant cycle embeddings of hypercubes. J. Syst. Architect. 53 (2007) 227-232