References
- S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38(4) (1989), pp. 555–566. doi: 10.1109/12.21148
- B. Becker and H.-U. Simon, How robust is the n-cube? Proceedings of 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 1986, pp. 283–291.
- J.A. Bondy and U.S.R. Murty, Graph Theory, Springer, New York, 2007.
- N.-W. Chang and S.-Y. Hsieh, {2,3}-Extraconnectivities of hypercube-like networks, J. Comput. Syst. Sci. 79(5) (2013), pp. 669–688. doi: 10.1016/j.jcss.2013.01.013
- E. Cheng and L. Lipták, Matching preclusion for some interconnection networks, Networks 50(2) (2007), pp. 173–180. doi: 10.1002/net.20187
- E. Cheng, L. Lesniak, M.J. Lipman, and L. Lipták, Matching preclusion for alternating group graphs and their generalizations, Int. J. Found. Comput. Sci. 19(6) (2008), pp. 1413–1437. doi: 10.1142/S0129054108006364
- E. Cheng, L. Lesniak, M.J. Lipman, and L. Lipták, Conditional matching preclusion Sets, Inf. Sci. 179(8) (2009), pp. 1092–1101. doi: 10.1016/j.ins.2008.10.029
- C.-W. Cheng, C.-W. Lee, and S.-Y. Hsieh, Conditional edge-fault Hamiltonicity of Cartesian product graphs, IEEE Trans. Parallel Distrib. Syst. 24(10) (2013), pp. 1951–1960. doi: 10.1109/TPDS.2012.304
- S.-Y. Hsieh and Y.-R. Cian, Conditional edge-fault Hamiltonicity of augmented cubes, Inf. Sci. 180(13) (2010), pp. 2596–2617. doi: 10.1016/j.ins.2010.03.005
- T.W. Hungerford, Algebra, Springer, New York, 1974.
- S. Latifi, A study of fault tolerance in star graph, Inf. Process. Lett. 102(5) (2007), pp. 196–200. doi: 10.1016/j.ipl.2006.12.013
- S. Latifi, E. Saberinia, and X. Wu, Robustness of star graph network under link failure, Inf. Sci. 178(3) (2008), pp. 802–806. doi: 10.1016/j.ins.2007.09.013
- J.-H. Park and S.H. Sang, Conditional matching preclusion for hypercube-like interconnection networks, Theor. Comput. Sci. 410(27–29) (2009), pp. 2632–2640. doi: 10.1016/j.tcs.2009.02.041
- D. Walker and S. Latifi, Improving bounds on link failure tolerance of the star graph, Inf. Sci. 180(13) (2010), pp. 2571–2575. doi: 10.1016/j.ins.2010.03.002
- S. Wang and K. Feng, Fault tolerance in the arrangement graphs, Theor. Comput. Sci. 533 (2014), pp. 64–71. doi: 10.1016/j.tcs.2014.03.025
- S. Wang and Y. Yang, Fault tolerance in bubble-sort graph networks, Theor. Comput. Sci. 421 (2012), pp. 62–69. doi: 10.1016/j.tcs.2011.11.016
- S. Wang, R. Wang, S. Lin, and J. Li, Matching preclusion for k-ary n-cubes, Discret. Appl. Math. 158(18) (2010), pp. 2066–2070. doi: 10.1016/j.dam.2010.08.017
- S. Wang, G. Zhang, and K. Feng, Fault tolerance in k-ary n-cube networks, Theor. Comput. Sci. 460 (2012), pp. 34–41. doi: 10.1016/j.tcs.2012.06.013
- M. Wang, W. Yang, and S. Wang, Conditional matching preclusion number for the Cayley graph on the symmetric group, Acta Math. Appl. Sin. (Chinese Series) 36(5) (2013), pp. 813–820.