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

DOI10.1016/j.dam.2007.04.002zbMath1127.68072OpenAlexW2099490027MaRDI 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 systemsdiameterhomomorphisminterconnection networksparallel processingroutingcellular networkscoset graphsCayley digraphsinternode distance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (6)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes