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

DOI10.1080/00207160512331331101zbMath1064.05082OpenAlexW2152171360MaRDI QIDQ5460566

Wenjun Xiao, Behrooz Parhami

Publication date: 18 July 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160512331331101

zbMATH Keywords

homomorphismdigraphsinterconnection networksparallel processingbroadcastinggraph factorizationcoset graphsCayley digraphscross-product graphs

Mathematics Subject Classification ID

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 ⋮ Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes ⋮ Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks ⋮ Fully symmetric swapped networks based on bipartite cluster connectivity ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Miscellaneous Digraph Classes

This page was built for publication: Some mathematical properties of cayley digraphs with applications to interconnection network design