Short containers in Cayley graphs

Discrete Applied Mathematics

Volumn 157, Issue 7, 2009, Pages 1354-1363

  Gao, Shuhong ^a   Hsu, D Frank ^b,c  

^a CLEMSON UNIVERSITY   (United States)

^b FORDHAM UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Cayley graphs; Disjoint ordering; Disjoint paths; Groups; Hypercubes; Star diameters; Star distances

Indexed keywords

CAYLEY GRAPHS; DISJOINT ORDERING; DISJOINT PATHS; GROUPS; HYPERCUBES; STAR DIAMETERS;

GRAPH THEORY;

EID: 62149117269     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.11.005     Document Type: Article

References (21)

1. Rabin M. Efficient dispersal of information for security, load balancing, and fault tolerance. J. Assoc. Comput. Mach. 36 2 (1989) 335-348
2. Hsu D.F. On container width and length in graphs, groups, and networks. IEICE Transactions, on Fundamentals of Electronics, Communi. Comput. Sci. E77-A 4 (1994) 668-680
3. Duh D.-R., and Chen G.-H. On the Rabin number problem. Networks 30 3 (1997) 219-230
4. Duh D.-R., Chen G.-H., and Hsu D.F. Combinatorial properties of generalized hypercube graphs. Inform. Process. Lett. 57 1 (1996) 41-45
5. Faudree R.J., Gould R.J., and Lesniak L.M. Generalized degrees and Menger path systems. Discrete Appl. Math. 37/38 (1992) 179-191
6. Hsu D.F., and Luczak T. On the k-diameter of k-regular k-connected graphs. Discrete Math. 133 1-3 (1994) 291-296
7. Ishigami Y. The wide-diameter of the n-dimensional toroidal mesh. Networks 27 4 (1996) 257-266
8. Latifi S. On the fault-diameter of the star graph. Inform. Process. Lett. 46 3 (1993) 143-150
9. Li Q., Sotteau D., and Xu J. 2-diameter of de Bruijn graphs. Networks 28 1 (1996) 7-14
10. Pyber L., and Tuza Z. Menger-type theorems with restrictions on path lengths. Discrete Math. 120 1-3 (1993) 161-174
11. Rouskov Y., and Srimani P.K. Fault diameter of star graphs. Inform. Process. Lett. 48 5 (1993) 243-251
12. Saad Y., and Schultz M.H. Topological properties of hypercubes. IEEE Trans. Comput. 37 7 (1988) 867-872
13. Sur S., and Srimani P.K. Topological properties of star graphs. Comput. Math. Appl. 25 12 (1993) 87-98
14. Gao S., Novick B., and Qiu K. From Hall's matching theorem to optimal routing on hypercubes. J. Comb. Theory B 74 (1998) 291-301
15. Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 4 (1989) 555-566
16. Chen C.-C., and Chen J. Optimal parallel routing in star networks. IEEE Trans. Comput. 46 12 (1997) 1293-1303
17. Gu Q.-P., and Peng S. Node-to-set disjoint paths problem in star graphs. Inform. Process. Lett. 62 4 (1997) 201-207
18. Kulasinghe P., and Bettayeb S. Vertex-disjoint paths in Cayley color graphs. Comput. Artif. Intell. 16 6 (1997) 583-597
19. Lakshmivarahan S., Jwo J.S., and Dhall S.K. Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Comput. 19 4 (1993) 361-407
20. Hall P. On representatives of subsets. J. London Math. Soc. 10 (1935) 26-30
21. Gao S., and Novick B. Fault tolerance of Cayley graphs. Ann. Comb. 11 2 (2007) 161-171