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

DOI10.1016/j.dam.2007.04.002zbMath1127.68072MaRDI QIDQ2381538

Wenjun Xiao, Behrooz Parhami

Publication date: 18 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.002

zbMATH Keywords

distributed systems; diameter; homomorphism; interconnection networks; parallel processing; routing; cellular networks; coset graphs; Cayley digraphs; internode distance

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

Resistance distances and the Kirchhoff index in Cayley graphs, Honeycomb toroidal graphs are Cayley graphs, The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups, Vertex-bipancyclicity of the generalized honeycomb tori, Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks, Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks

Cites Work

• Unnamed Item
• Unnamed Item
• Incomplete \(k\)-ary \(n\)-cube and its derivatives.
• Group Action Graphs and Parallel Architectures
• A group-theoretic model for symmetric interconnection networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design