References
- C. Balibuena, P. García-Vázquez, and X. Marcote, Sufficient conditions for λ′-optimality in graphs with girth g, J. Graph Theory 52 (2006), pp. 73–86. doi: 10.1002/jgt.20150
- D. Bauer, F. Boesch, C. Suffel, and R. Tindell, Combinatorial optimization problems in analysis and design of probabilistic nerwork, Networks 15 (1985), pp. 257–271. doi: 10.1002/net.3230150210
- J.A. Bondy and U.S.R. Murty, Graph Theory With Applications, Macmillan, London, 1976.
- P. Bonsma, N. Ueffing, and L. Volkmann, Edge-cuts leaving components of order at least three, Discrete Math. 256 (2002), pp. 431–439. doi: 10.1016/S0012-365X(02)00385-0
- D.Z. Du, D.F. Hsu, F.K. Hwang, and X.M. Zhang, The hamiltonian property of generalized De Bruijn digraphs, J. Comb. Ser. B 52 (1991), pp. 1–8. doi: 10.1016/0095-8956(91)90084-W
- D.Z. Du, D.F. Hsu, H.Q. Ngo, and G.W. Peck, On connectivity of consecutive-d digraphs, Discrete Math. 257 (2002), pp. 371–384. doi: 10.1016/S0012-365X(02)00436-3
- A.H. Esfahanian and S.L. Hakimi, On computing a conditional edge connectivity of a graph, Inf. Process. Lett. 27 (1988), pp. 195–199. doi: 10.1016/0020-0190(88)90025-7
- A. Hellwig and L. Volkmann, Maximally edge-connected and vertex-connected graphs and digraphs, Discrete Math. 308 (2008), pp. 3265–3296. doi: 10.1016/j.disc.2007.06.035
- N. Homobono, Connectivity of generalized De Bruijn graphs, Ars Comb. 25 (1988), pp. 179–194.
- Q.L. Li and Q. Li, Reliability analysis of circulant graphs, Networks 28 (1988), pp. 61–65.
- J.X. Men and Y. Ji, On a kind of restricted edge connectivity of graphs, Discrete Appl. Math. 117 (2002), pp. 183–193. doi: 10.1016/S0166-218X(00)00337-1
- E.F. Moore and C. Shannon, Reliable circuits using less reliable relays (I), J. Franklin Inst. 262 (1956), pp. 191–208.
- J.P. Ou, Edge cuts leaving components of order at least m, Discrete Math. 305 (2005), pp. 365–371. doi: 10.1016/j.disc.2005.10.012
- J.P. Ou, On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks, Appl. Math. Comput. 217 (2010) 2602–2607. doi: 10.1016/j.amc.2010.07.073
- J.P. Ou and F.J. Zhang, Reliability of undirected De Bruijn networks, Chin. J. Eng. Math. 21 (2004), pp. 945–952.
- J.P. Ou and F.J. Zhang, 3-Restricted edge connectivity of vertex transitive graphs, Ars Comb. 74 (2005), pp. 291–302.
- J.S. Provan and M.O. Ball, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM J. Comput. 12 (1983), pp. 777–788. doi: 10.1137/0212053
- M. Wang and Q. Li, Conditional edge connectivity properties, reliability comparison and transitivity of graphs, Discrete Math. 258 (2002), pp. 205–214. doi: 10.1016/S0012-365X(02)00299-6