Orienting Cayley graphs generated by transposition trees

Computers and Mathematics with Applications

Volumn 55, Issue 11, 2008, Pages 2662-2672

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

^a OAKLAND UNIVERSITY   (United States)

Author keywords

Cayley graphs; Connectivity; Interconnection networks; Unidirectional graphs

Indexed keywords

INFORMATION ANALYSIS; INTERCONNECTION NETWORKS;

CAYLEY GRAPHS; UNIDIRECTIONAL GRAPHS;

TREES (MATHEMATICS);

EID: 41949101620     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2007.10.016     Document Type: Article

References (24)

1. Day K., and Tripathi A. Unidirectional star graphs. Inform. Process. Lett. 45 (1993) 123-129
2. Cheng E., and Lipman M.J. On the Day-Tripathi orientation of the star graphs: Connectivity. Inform. Process. Lett. 73 (2000) 5-10
3. Cheng E., and Lipman M.J. Connectivity properties of unidirectional star graphs. Congr. Numer. 150 (2001) 33-42
4. Cheng E., and Lipman M.J. Orienting split-stars and alternating group graphs. Networks 35 (2000) 139-144
5. Chern S.C., Jwo J.S., and Tuan T.C. Uni-directional alternating group graphs. Lecture Notes in Comput. Sci. 959 (1995), Springer, Berlin 490-495
6. C.H. Chou, D.H.C. Du, Unidirectional hypercubes, in: Proc. Supercomputing'90, 1990, pp. 254-263
7. Comellas F., and Fiol M.A. Vertex-symmetric digraphs with small diameter. Discrete Appl. Math. 58 (1995) 1-11
8. Jwo J.S., and Tuan T.C. On container length and connectivity in unidirectional hypercubes. Networks 32 (1998) 307-317
9. Cheng E., and Lipman M.J. Orienting the arrangement graphs. Congr. Numer. 142 (2000) 97-112
10. Cheng E., and Lipman M.J. Unidirectional (n, k)-star graphs. J. Interconnection Networks 3 (2002) 19-34
11. n, k, {combining right arrow above}). Networks 46 (2005) 154-162
12. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. Int'l Conf. Parallel Processing, 1987, pp. 393-400
13. S.B. Akers, B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, in: Pro. Int'l. Conf. Parallel Proc., 1986, pp. 216-223
14. Tchuente M. Generation of permutations by graphical exchanges. Ars Combin. 14 (1982) 115-122
15. Araki T. Hyper hamiltonian laceability of Cayley graphs generated by transpositions. Networks 48 (2006) 121-124
16. West D.B. Introduction to Graph Theory (1996), Prentice Hall
17. Lovász L. Combinatorial Problems and Exercises. 2nd ed. (1993), Akadémiai Kiadó, Budapest
18. Godsil C.D. GRR's for non-solvable groups. Coll. Math. Soc. János Bolyai 25 (1981) 221-239
19. Cheng E., and Lipták L. Structural properties of Cayley graphs generated by transposition trees. Congr. Numer. 180 (2006) 81-96
20. E. Cheng, L. Lipták, A supplement to the paper "Structural properties of Cayley graphs generated a by transposition trees", Technical Report 2007-6, Oakland University, 2007
21. Cheng E., and Lipták L. Fault resiliency of Cayley graphs generated by transpositions. Internat. J. Found. Comput. Sci. 18 (2007) 1005-1022
22. Cheng E., and Lipták L. Linearly many faults in Cayley graphs generated by transposition trees. Inform. Sci. 177 (2007) 4877-4882
23. Bauer D., Boesch F., Suffel C., and Tindell R. Connectivity extremal problems and the design of reliable probabilistic networks. The Theory and Application of Graphs (1981), Wiley, New York 89-98
24. Nash-Williams C.St.J.A. On orientations, connectivity and odd-vertex pairings in finite graph. Canad. J. Math. 12 (1960) 555-567