1. D. P. Bertsekas et al., “Optimal Communication Algorithms for Hypercubes”, Journal of Parallel and Distributed Computing, vol. 11, pp. 263–275, 1991.
2. Bella Bose, Bob Broeg, Younggeun Kwon, and Yaagoub Ashir, “Lee Distance and Topological Properties of k:-ary n-Cubes”, IEEE Transactions on Computers, To appear.
3. Ming-Syan Chen, Kang G. Shin, and Dilip D. Kandlur, “Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors”, IEEE Transactions on Computers, vol. 39, no. 1, pp. 10–18, January 1990.
4. Jeffrey T. Draper and Joydeep Ghosh, “Multipath E-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in k-ary n-cubes”, in Proceedings of the Sixth International Parallel Processing Symposium, (Beverly Hills, CA), pp. 407–410, IEEE, March 1992.
5. Nora Hartsfield and Gerhard Ringle, “Pearls in Graph Theory: A Comprehensive Introduction”. San Diego, CA: Academic Press, 1990.