Some mathematical properties of Cayley digraphs with applications to interconnection network design

International Journal of Computer Mathematics

Volumn 82, Issue 5, 2005, Pages 521-528

  Xiao, Wenjun ^a,b   Parhami, Behrooz ^c  

^a XIAMEN UNIVERSITY   (China)

^b SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^c University of California   (United States)

Author keywords

Broadcasting; Cayley digraphs; Coset graphs; Cross product graphs; Digraphs; Graph factorization; Homomorphism; Interconnection networks; Parallel processing

Indexed keywords

CAYLEY DIAGRAPHS; COSET GRAPHS; CROSS-PRODUCT GRAPHS; DIAGRAPHS;

BROADCASTING; INTERCONNECTION NETWORKS;

GRAPH THEORY;

EID: 27844449141     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160512331331101     Document Type: Article

References (8)

1. Akers, S.B. and Krishnamurthy, B., 1989, A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38, 555-566.
2. Annexstein, F., Baumslag, M. and Rosenberg, A.L., 1990, Group action graphs and parallel architectures. SIAM J. Comput., 19, 544-569.
3. Heydemann, M., 1997, Cayley graphs and interconnection networks. In: G. Hahn and G. Sabidussi (Eds), Graph Symmetry: Algebraic Methods and Applications, pp. 167-224.
4. Biggs, N., 1993, Algebraic Graph Theory (Cambridge: Cambridge University Press).
5. Leighton, F.T., 1992, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (San Mateo, California: Morgan Kaufmann).
6. Parhami, B., 1999, Introduction to Parallel Processing: Algorithms and Architectures (New York: Plenum Press).
7. Fraigniaud, P. and Lazard, E., 1994, Methods and problems of communication in usual networks. Discrete Appl. Math., 53, 79-133.
8. Parhami, B., 2000, Challenges in interconnection network design in the era of multiprocessor and massively parallel microchips. Proc. Int. Conf. on Communications in Computing (Las Vegas, Nevoda: CSREA Press), pp. 241-246.