1. S.B. Akers, D. Harel, B. Krishnameurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393–400
2. Fault-tolerant broadcasting on the arrangement graph;Bai;Comput J,1998
3. Efficient broadcast in an arrangement graph using multiple spanning trees;Chen;IEICE Trans Fundamentals Elect Commun Comput Sci,2000
4. A fault-tolerant reconfiguration scheme in the faulty star graph;Chen;J Inform Sci Eng,2000
5. K. Day, A. Tripathi, Characterization of node disjoint path in arrangement graphs, in: Technical Report TR91-43, Computer Science Department, University of Minnesota, 1991