Issue No. 04 - April (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21148
The authors develop a formal group-theoretic model, called the Cayley graph model, for designing, analyzing, and improving such networks. They show that this model is universal and demonstrate how interconnection networks can be concisely represented in this model. It is shown that this model enables the authors to design networks based on representations of finite groups. They can then analyze
group-theoretic model; symmetric interconnection networks; Cayley graph model; finite groups; combinatorial problems; star graphs; pancake graphs; graph theory; multiprocessor interconnection networks.
B. Krishnamurthy and S. Akers, "A Group-Theoretic Model for Symmetric Interconnection Networks," in IEEE Transactions on Computers, vol. 38, no. , pp. 555-566, 1989.