[1] BONDY J A, MURTY U S R. Graph Theory[M]. New York:Springer, 2008:1-450. [2] BRIGHAM R C, HARARY F, VIOLIN E C, et al. Perfect-matching preclusion[J]. Congressus Numerantium, 2005, 174:185-192. [3] PARK J H, IHM I. Strong matching preclusion[J]. Theoretical Computer Science, 2011, 412(45):6409-6419. [4] FENG K, WANG S. Strong matching preclusion for two-dimensional torus networks[J]. International Journal of Computer Mathematics, 2015, 92(3):473-485. [5] CHENG E, KELM J, RENZI J. Strong matching preclusion of (n,k)-star graphs[J]. Theoretical Computer Science, 2016, 615:91-101. [6] PARK J H, IHM I. Strong matching preclusion under the conditional fault model[J]. Discrete Applied Mathematics, 2013, 161(7/8):1093-1105. [7] WANG S, WANG R, LIN S, et al. Matching preclusion for k-ary n-cubes[J]. Discrete Applied Mathematics, 2010, 158(18):2066-2070. [8] WANG S, FENG K, ZHANG G. Strong matching preclusion for k-ary n-cubes[J]. Discrete Applied Mathematics, 2013, 161(18):3054-3062. [9] 杨玉星,王世英.k元n立方网络的k圈排除问题的递归算法[J].计算机应用,2013,33(9):2401-2403.(YANG Y X, WANG S Y. Recursive algorithm for k-cycle preclusion problem in k-ary n-cubes[J]. Journal of Computer Applications, 2013, 33(9):2401-2403.) [10] YANG Y, LI J, WANG S. Embedding various cycles with prescribed paths into k-ary n-cubes[J]. Discrete Applied Mathematics, 2017, 220:161-169. [11] PETERSON C, SUTTON J, WILEY P. iWarp:a 100-MOPS, LIW microprocessor for multicomputers[J]. IEEE Micro, 1991, 11(3):26-29. [12] ANDERSON E, BROOKS J, GRASSL C, et al. Performance of the CRAY T3E multiprocessor[C]//Proceedings of the 1997 ACM/IEEE Conference on Supercomputing. New York:ACM, 1997:1-17. [13] ADIGA N R, BLUMRICH M A, CHEN D, et al. Blue Gene/L torus interconnection network[J]. IBM Journal of Research and Development, 2005, 49(2/3):265-276. |