1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proc. Int’l Conf. Parallel Processing, 1987, pp. 393–400.
2. A broadcasting algorithm with time and message optimum on arrangement graphs;Bai;Journal of Graph Algorithms and Applications,1998
3. Perfect-matching preclusion;Brigham;Congressus Numerntium,2005
4. Improved deterministic algorithms for weighted matching and packing problems;Chen;Theoretical Computer Science,2011
5. Weak-vertex-pancyclicity of (n,k)-star graphs;Chen;Theoretical Computer Science,2008