Embedding Hamiltonian cycles in alternating group graphs under conditional fault model

Information Sciences

Volumn 179, Issue 6, 2009, Pages 851-857

  Tsai, Ping Ying ^a   Fu, Jung Sheng ^b   Chen, Gen Huey ^c  

^a HWA HSIA INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL UNITED UNIVERSITY   (Taiwan)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Alternating group graph; Cayley graph; Conditional fault; Fault tolerance; Hamiltonian cycle

Indexed keywords

ERRORS; FAULT TOLERANCE; GRAPH THEORY; HAMILTONIANS; MEATS; QUALITY ASSURANCE;

ALTERNATING GROUP GRAPH; CAYLEY GRAPH; CONDITIONAL FAULT; FAULT MODELS; HAMILTONIAN CYCLE; LINK FAULTS;

RELIABILITY;

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

References (36)

1. Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38 4 (1989) 555-566
2. Akl S.G. Parallel Computation: Models and Methods (1997), Prentice Hall, NJ
3. Ashir Y.A., and Stewart I.A. Fault-tolerant embedding of Hamiltonian circuits in k-ary n-cube. SIAM Journal on Discrete Mathematics 15 3 (2002) 317-328
4. Bagherzadeh N., Nassif N., and Latifi S. A routing and broadcasting scheme on faulty star graphs. IEEE Transactions on Computers 42 11 (1993) 1398-1403
5. Chan M.Y., and Lee S.J. On the existence of Hamiltonian circuits in faulty hypercubes. SIAM Journal on Discrete Mathematics 4 4 (1991) 511-527
6. 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
7. Chang J.M., and Yang J.S. Fault-tolerant cycle-embedding in alternating group graphs. Applied Mathematics and Computation 197 (2008) 760-767
8. Chiang W.K., and Chen R.J. On the arrangement graph. Information Processing Letters 66 (1998) 215-219
9. Choudum S.A., and Sunitha V. Augmented cubes. Networks 40 2 (2002) 71-84
10. Day K. The conditional node connectivity of the k-ary n-cube. Journal of Interconnection Networks 5 1 (2004) 13-26
11. Day K., and Al-Ayyoub A.E. Fault diameter of k-ary n-cube networks. IEEE Transactions on Parallel and Distributed Systems 8 9 (1997) 903-907
12. Diks K., and Pele A. Efficient gossiping by packets in networks with random faults. SIAM Journal on Discrete Mathematics 9 1 (1996) 7-18
13. Dvořák T., and Gregor P. Hamiltonian fault-tolerance of hypercubes. Electronic Notes in Discrete Mathematics 29 (2007) 471-477
14. Esfahanian A.H. Generalized measures of fault tolerance with application to N-cube networks. IEEE Transactions on Computers 38 11 (1989) 1586-1591
15. Fu J.S. Conditional fault-tolerant hamiltonicity of star graphs. Parallel Computing 33 (2007) 488-496
16. Farahabady M.R.H., and Sarbazi-Azad H. The grid-pyramid: a generalized pyramid network. The Journal of Supercomputing 37 (2006) 23-45
17. Hsieh S.Y., and Chen C.H. Pancyclicity on Möbius cubes with maximal edge faults. Parallel Computing 30 (2004) 407-421
18. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with vertex faults. Theoretical Computer Science 262 1-2 (2001) 215-227
19. Hsu H.C., Chiang L.C., Tan J.J.M., and Hsu L.H. Fault hamiltonicity of augmented cubes. Parallel Computing 31 (2005) 131-145
20. Hsu H.C., Li T.K., Tan J.J.M., and Hsu L.H. Fault hamiltonicity and fault Hamiltonian connectivity of arrangement graphs. IEEE Transactions on Computers 53 1 (2004) 39-53
21. Hung H.S., Fu J.S., and Chen G.H. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Information Sciences 177 24 (2007) 5664-5674
22. Jwo J.S., Lakshmivarahan S., and Dhall S.K. A new class of interconnection networks based on the alternating group. Networks 23 (1993) 315-326
23. Latifi S. Combinatorial analysis of the fault-diameter of the n-cube. IEEE Transactions on Computers 42 1 (1993) 27-33
24. Latifi S., Hegde M., and Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Transactions on Computers 43 2 (1994) 218-222
25. Latifi S., Saberinia E., and Wu X. Robustness of star graph network under link failure. Information Sciences 178 3 (2008) 802-806
26. Li Q., and Zhang Y. Restricted connectivity and restricted fault diameter of some interconnection networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 21 (1995) 267-273
27. Li T.K., Tan J.J.M., Hsu L.H., and Sung T.Y. The shuffle-cubes and their generalization. Information Processing Letters 77 (2001) 35-41
28. Li T.K., Tan J.J.M., and Hsu L.H. Hyper Hamiltonian laceability on the edge fault star graph. Information Sciences 165 (2004) 59-71
29. Rosenberg A.L. Issues in the study of graph embedding. Graph Theoretic Concepts in Computer Science. Lecture Notes in Computer Science vol. 100 (1981), Springer-Verlag, Berlin, Heidelberg, Germany
30. Rouskov Y., Latifi S., and Srimani P.K. Conditional fault diameter of star graph networks. Journal of Parallel and Distributed Computing 33 1 (1996) 91-97
31. Teng Y.H., Tan J.J.M., and Hsu L.H. Panpositionable hamiltonicity of the alternating group graphs. Networks 50 (2007) 146-156
32. Tsai C.H. Linear array and ring embeddings in conditional faulty hypercubes. Theoretical Computer Science 314 (2004) 431-443
33. Tsai C.H., and Lai Y.C. Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes. Information Sciences 177 24 (2007) 5590-5597
34. P.Y. Tsai, J.S. Fu, G.H. Chen, Fault-free longest paths in star networks with conditional link faults, Theoretical Computer Science, doi:10.1016/j.tcs.2008.11.012.
35. Wu J. Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets. IEEE Transactions on Computers 47 8 (1998) 888-893
36. .