[1] LIN L, XU L, ZHOU S, et al.  The reliability of subgraphs in the arrangement graph[J]. IEEE Transactions on Reliability, 2015, 64(2): 807-818.   doi: 10.1109/TR.2015.2413372
[2] CHIANG W K, CHEN R J.  On the arrangement graph[J]. Information Processing Letters, 1998, 66(4): 215-219.   doi: 10.1016/S0020-0190(98)00052-0
[3] CHENG E, GROSSMAN J W, QIU K, et al.  The number of shortest paths in the arrangement graph[J]. Information Sciences, 2013, 240(11): 191-204.
[4] FENG K, WANG S Y, ZHANG G Z.  Link failure tolerance in the arrangement graphs[J]. International Journal of Foundations of Computer Science, 2015, 26(2): 241-254.   doi: 10.1142/s0129054115500148
[5] YANG W, LI H, GUO X.  A kind of conditional fault tolerance of (n, k)-star graphs[J]. Information Processing Letters, 2010, 110(22): 1007-1011.   doi: 10.1016/j.ipl.2010.08.015
[6] CANCELA H, KHADIRI M E, PETINGI L A.  Polynomial-time topological reductions that preserve the diameter constrained reliability of a communication network[J]. IEEE Transactions on Reliability, 2011, 60(4): 845-851.   doi: 10.1109/TR.2011.2170250
[7] ZHANG Z, AN W, SHAO F.  Cascading failures on reli-ability in cyber-physical system[J]. IEEE Transactions on Reliability, 2016, 65(4): 1745-1754.   doi: 10.1109/TR.2016.2606125