Linearly many faults in Cayley graphs generated by transposition trees

Information Sciences

Volumn 177, Issue 22, 2007, Pages 4877-4882

  Cheng, Eddie ^a   Lipták, László ^a  

^a OAKLAND UNIVERSITY   (United States)

Author keywords

Bubble sort graph; Cayley graphs; Interconnection networks; Star graph; Superconnectedness; Transposition tree

Indexed keywords

DECISION TREES; INFORMATION SCIENCE; LINEAR SYSTEMS;

BUBBLE-SORT GRAPHS; CAYLEY GRAPHS; STAR GRAPHS; SUPERCONNECTEDNESS; TRANSPOSITION TREES;

GRAPH THEORY;

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

References (35)

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393-400.
2. Akers S.B., and Krishnamurthy B. A group theoretic model for symmetric interconnection networks. IEEE Transactionsaction on Computers 38 (1989) 555-565
3. Araki T. Hyper hamiltonian laceability of Cayley graphs generated by transpositions. Networks (2006) 121-124
4. Bagherzadeh N., Dowd M., and Latifi S. A well-behaved enumeration of star graphs. IEEE Transactions on Parallel and Distributed Systems 6 5 (1995) 531-535
5. 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
6. Y.-C. Chen, J.J.M. Tan, Restricted connectivity for three families of interconnection networks, manuscript.
7. Chen Y.-C., Tan J.J.M., Hsu L.-H., and Kao S.-S. Super-connectivity and super-edge-connectivity for some interconnection networks. Applied Mathematics and Computation 140 (2003) 245-254
8. Cheng E., Kikas L., and Kruk S.G. A disjoint path problem in the alternating group graphs. Congressus Numerantium 175 (2005) 117-159
9. n, k, →). Networks 46 (2005) 154-162
10. Cheng E., and Lipman M.J. Increasing the connectivity of split-stars. Congressus Numerantium 146 (2000) 97-111
11. Cheng E., and Lipman M.J. On the Day-Tripathi orientation of the star graphs: connectivity. Information Processing Letters 73 (2000) 5-10
12. Cheng E., and Lipman M.J. Orienting split-stars and alternating group graphs. Networks 35 (2000) 139-144
13. Cheng E., and Lipman M.J. Connectivity properties of unidirectional star graphs. Congressus Numerantium 150 (2001) 33-42
14. Cheng E., and Lipman M.J. Increasing the connectivity of the star graphs. Networks 40 3 (2002) 165-169
15. Cheng E., and Lipman M.J. Unidirectional (n, k)-star graphs. Journal of Interconnection Networks 3 (2002) 19-34
16. Cheng E., and Lipman M.J. Vulnerability issues of star graphs and split-stars: strength and toughness. Discrete Applied Mathematics 118 (2002) 163-179
17. Cheng E., Lipman M.J., and Park H.A. Super connectivity of star graphs, alternating group graphs and split-stars. Ars Combinatoria 59 (2001) 107-116
18. E. Cheng, L. Lipták, Fault resiliency of Cayley graphs generated by transpositions, International Journal of Foundations of Computer Science, in press.
19. Cheng E., and Lipták L. Structural properties of Cayley graphs generated by transposition trees. Congressus Numerantium 180 (2006) 81-96
20. Cheng E., and Lipták L. Structural properties of hyper-stars. Ars Combinatoria 80 (2006) 65-73
21. Chiang W.-K., and Chen R.-J. The (n, k)-star graph: a generalized star graph. Information Processing Letters 56 (1995) 259-264
22. Day K., and Tripathi A. Arrangement graphs: a class of generalized star graphs. Information Processing Letters 42 (1992) 235-241
23. Gu Q., and Peng S. An efficient algorithm for k-pairwise disjoint paths in star graphs. Information Processing Letters 67 (1998) 283-287
24. Gu Q., and Peng S. Cluster fault tolerant routing in star graphs. Networks 35 (2000) 83-90
25. Hoelzeman D.A., and Bettayeb S. On the genus of the star graphs. IEEE Transactions on Computers 43 (1994) 755-759
26. 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
27. Hsu H.-C., Hsieh Y.-L., Tan J.J.M., and Hsu L.-H. Fault hamiltonicity and fault hamiltonian connectivity of the (n, k)-star graphs. Networks 42 (2003) 189-201
28. 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
29. Lee H.O., Kim J.S., Oh E., and Lim H.S. Hyper-star graph: a new interconnection network improving the network cost of the hypercube. In Lecture Notes in Computer Science 2510 (2002), Springer, Berlin pp. 858-865
30. Li T.-K., Tan J.J.M., and Hsu L.-H. Hyper hamiltonian laceability on edge fault star graph. Information Sciences 165 (2004) 59-71
31. Shen X., Hu Q., Cong B., Sudborough H., Girou M., and Bettayeb S. The 4-star graph is not a subgraph of any hypercube. Information Processing Letters 37 (1993) 199-203
32. Sheu J.-J., Tan J.J.M., and Hsu L.-H. Routing properties of supercubes. Information Sciences 131 (2001) 107-128
33. Tchuente M. Generation of permutations by graphical exchanges. Ars Combinatoria 14 (1982) 115-122
34. Teng Y.-H., Tan J.J.M., Ho T.-Y., and Hsu L.-H. Distributed algorithms for finding the unique minimun distance dominating set in directed split-stars. Journal of Parallel and Distributed Computing 63 (2003) 481-487
35. Tseng Y.-C., Chen Y.-S., Juang T.-Y., and Chang C.-J. Congestion-free, dilation-2 embedding of complex binary trees into star graphs. Networks 33 (1999) 221-231