[1]WALKER D, LATIFI S. Improving bounds on link failure tolerance of the star graph [J]. Information Sciences, 2010, 180(13): 2571-2575.[2]HARARY F. Conditional connectivity [J]. Networks, 1983, 13(3): 347-357.[3]BALLBUENA C, CERA M, DIEZ A, et al. Diameter-girth sufficient conditions for optimal extraconnectivity in graphs [J]. Discrete Mathematics, 2008, 308(16): 3526-3536.[4]WANG S Y, YUAN J, LIU A X. k-restricted edge connectivity for some interconnection networks [J]. Applied Mathematics and Computation, 2008, 201(1/2): 587-596.[5]XU J M, ZHU Q, XU M. Fault-tolerant analysis of a class of networks [J]. Information Processing Letters, 2007, 103(6): 222-226.[6]XU J M, WANG J W, WANG W W. On super and restricted connectivity of some interconnection networks [J]. Ars Combinatoria, 2010, 94(1): 25-32.[7]王建伟,徐俊明. 变形超立方体网络的可靠性分析[J]. 中国科学技术大学学报, 2009, 39(12): 1248-1252.[8]STEWART I A, XIANG Y H. Bipanconnectivity and bipancyclicity in k-ary n-cubes [J]. IEEE Transactions on Parallel and Distributed Systems, 2009, 20(1): 25-33.[9]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): 265-276.[10]DAY K. The conditional node connectivity of the k-ary n-cube [J]. Journal of Interconnection Networks, 2004, 5(1): 13-26.[11]YANG W H, MENG J X. Extraconnectivity of hypercubes [J]. Applied Mathematics Letters, 2009, 22(6): 887-891.[12]HSIEH S Y, CHANG Y H. Extraconnectivity of k-ary n-cube networks [J]. Theoretical Computer Science, 2012, 443(6): 63-69.[13]BONDY J A, MURTY U S R. Graph theory[M]. New York: Springer Press, 2008. |