1. S. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to then-cube.Proceedings of the 1987International Conference on Parallel Processing, pp. 393–400.
2. S. Akers and B. Krishnamurthy. Group graphs as interconnection networks.Proceedings of the 14th International Conference on Fault Tolerant Computing, 1984, pp. 422–427.
3. S. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks.IEEE Transactions on Computers, Vol. 38, No. 4 (1989), pp. 555–566.
4. S. Bhatt, P. Chung, J.-W. Hong, F. T. Leighton, and A. Rosenberg. Optimal simulations by butterfly networks.Proceedings of the 23rd Annual ACM Theory of the Computer Science Conference, 1988, pp. 192–204.
5. F. T. Leighton.Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992, p. 776, Problem 3.355.