References
- B. Bose, B. Broeg, Y. Kwon and Y. Ashir, Lee distance and topological properties of k-ary n-cubes, IEEE Trans. Comput. 44(8) (1995), pp. 1021–1030. doi: 10.1109/12.403718
- N.-W. Chang and S.-Y. Hsieh, {2,3}-Extraconnectivities of hypercube-like networks, J. Comput. Syst. Sci. 79 (2013), pp. 669–688. doi: 10.1016/j.jcss.2013.01.013
- N.-W. Chang, C.-Y. Tsai and S.-Y. Hsieh, On 3-extra connectivity and 3-extra edge connectivity of folded hypercubes, IEEE Trans. Comput. 63 (2014), pp. 1594–1600. doi: 10.1109/TC.2013.10
- E. Cheng, L. Lipták and F. Sala, Linearly many faults in 2-tree-generated networks, Networks 55 (2010), pp. 90–98.
- K. Day, The conditional node connectivity of the k-ary n-cube, J. Inter. Net. 5(1) (2004), pp. 13–26. doi: 10.1142/S0219265904001003
- J. Fábrega and M.A. Fiol, On the extra connectivity graphs, Discrete Math. 155 (1996), pp. 49–57. doi: 10.1016/0012-365X(94)00369-T
- S.A. Ghozati and H.C. Wasserman, The k-ary n-cube network: Modeling, topological properties and routing strategies, Comput. Electr. Eng. 25(3) (1999), pp. 155–168. doi: 10.1016/S0045-7906(99)00003-8
- M.-M. Gu and R.-X. Hao, 3-extra connectivity of 3-ary n-cube networks, Inform. Process. Lett. 114 (2014), pp. 486–491. doi: 10.1016/j.ipl.2014.04.003
- R.-X. Hao, Y.-Q. Feng, and J.-X. Zhou, Conditional diagnosability of alternating group graphs, IEEE Trans. Comput. 62(4) (2013), pp. 827–831. doi: 10.1109/TC.2012.15
- R.-X. Hao and J.-X. Zhou, Characterize a kind of fault tolerance of alternating group network, Acta Math. Sin. 55(6) (2012), pp. 1055–1066.
- F. Harary, Conditional connectivity, Networks 13(3) (1983), pp. 347–357. doi: 10.1002/net.3230130303
- S.-Y. Hsieh and Y.-H. Chang, Extraconnectivity of k-ary n-cube networks, Theor. Comput. Sci. 443 (2012), pp. 63–69. doi: 10.1016/j.tcs.2012.03.030
- S.-Y. Hsieh, T.-J. Lin and H.-L. Huang, Panconnectivity and edge-pancyclicity of 3-ary n-cubes, J. Supercomput. 42 (2007), pp. 225–233. doi: 10.1007/s11227-007-0133-5
- H.-Z. Li, J.-X. Meng and W.-H. Yang, 3-extra connectivity of Cayley graphs generated by transposition generating trees, J. Xinjiang Univ. 28(2) (2011), pp. 149–151.
- H. Li and W.-H. Yang, Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes, Discrete Appl. Math. 161 (2013), pp. 2753–2757. doi: 10.1016/j.dam.2013.04.009
- W.A. Najjar and J.-L. Gaudiot, Network resilience: A measure of network fault tolerance, IEEE Trans. Comput. 39(2) (1990), pp. 174–181. doi: 10.1109/12.45203
- S.L. Scott and J.R. Goodman, The impact of pipelined channels on k-ary n-cube networks, IEEE Trans. Parallel Distrib. Syst. 5(1) (1994), pp. 2–16. doi: 10.1109/71.262584
- W.-H. Yang and J.-X. Meng, Extraconnectivity of hypercubes, Appl. Math. Lett. 22(6) (2009), pp. 887–891. doi: 10.1016/j.aml.2008.07.016
- W.-H. Yang and J.-X. Meng, Extraconnectivity of hypercubes (II), Aust. J. Combin. 47 (2010), pp. 189–195.