Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes

Discrete Applied Mathematics

Volumn 155, Issue 13, 2007, Pages 1752-1760

  Xiao, Wenjun ^a   Parhami, Behrooz ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b University of California   (United States)

Author keywords

Cayley digraphs; Cellular networks; Coset graphs; Diameter; Distributed systems; Homomorphism; Interconnection networks; Internode distance; Parallel processing; Routing

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; ROUTING ALGORITHMS;

CAYLEY DIGRAPHS; CELLULAR NETWORKS; COSET GRAPHS; DIAMETERS; DISTRIBUTED SYSTEMS; HOMOMORPHISM; INTERNODE DISTANCE;

GRAPH THEORY;

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

References (11)

1. Akers S.B., and Krishnamurthy B. A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 (1989) 555-566
2. Annexstein F., Baumslag M., and Rosenberg A.L. Group action graphs and parallel architectures. SIAM J. Comput. 19 (1990) 544-569
3. Biggs N. Algebraic Graph Theory (1993), Cambridge University Press, Cambridge
4. M. Heydemann, Cayley graphs and interconnection networks, in: Graph Symmetry: Algebraic Methods and Applications, 1997, pp. 167-224.
5. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann, Los Altos, CA
6. Nocetti F.G., Stojmenovic I., and Zhang J. Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks. IEEE Trans. Parallel Distributed Systems 13 (2002) 963-971
7. Parhami B. Introduction to Parallel Processing: Algorithms and Architectures (1999), Plenum, New York
8. Parhami B., and Kwai D.M. A unified formulation of honeycomb and diamond networks. IEEE Trans. Parallel Distributed Systems 12 (2001) 74-80
9. B. Parhami, D.M. Kwai, Incomplete k-ary n-cube and its derivatives, J. Parallel Distributed Systems 64 (2004) 183-190.
10. Stojmenovic I. Honeycomb networks: topological properties and communication algorithms. IEEE Trans. Parallel Distributed Systems 8 (1997) 1036-1042
11. Xiao W., and Parhami B. Some mathematical properties of Cayley digraphs with applications to interconnection network design. Internat. J. Comput. Math. 82 (2005) 521-528