1. S.B. Akers, D. Horel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. Int. Conference on Parallel Processing, 1987, pp. 393–400
2. A group-theoretic model for symmetric interconnection networks;Akers;IEEE Transactions on Computers,1989
3. N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, Ph.D. Thesis, University of Technology, Berlin, Germany, 1995. Also available at: ftp://ftp.zib.de/pub/zib-publications/reports/TR-96-03.ps
4. Fault-tolerant embedding of Hamiltonian circuits in k-ary n-cube;Ashir;SIAM Journal on Discrete Mathematics,2002
5. A routing and broadcasting scheme on faulty star graphs;Bagherzadeh;IEEE Transactions on Computers,1993