1. 1. Akers, S. B., D. Harel, B. Krishnamurthy. The Star Graph: An Attractive Alternative to n-Cube. – In: Proc. of International Conference on Parallel Processing (ICPP’87), St. Charles, Illinois, 1987, pp. 393-400.
2. 2. Day, K., A. Tripathi. A Comparative Study of Topological Properties of Hypercubes and Star Graphs. – Technical Report TR, 1991, Computer Science Department, University of Minnesota, Minneapolis, MN, pp. 91-10.
3. 3. Qiu, K., H. Meijer, S. G. Akl. Decomposing a Star Graph into Disjoint Cycles. – Information Processing Letters, Vol. 39, 1991, No 3, pp. 125-129.
4. 4. Nigam, M., S. Sahni, B. Krishnamurthy. Embedding Hamiltonians, and Hypercubes in Star Interconnection Graphs. – In: Proc. of International Conference on Parallel Processing, 1990, pp. 340-343.
5. 5. El-Amawy, A., S. Latifi. Properties and performance of Folded Hypercube. – IEEE Transactions on Parallel and Distributed Systems, Vol. 2, 1991, No 2, pp. 31-42.