Edge cuts leaving components of order at least m

Discrete Mathematics

Volumn 305, Issue 1-3, 2005, Pages 365-371

  Ou, Jianping ^a  

^a Wuyi University   (China)

Author keywords

Edge cuts; Graph; Restricted edge connectivity

Indexed keywords

CHARACTERIZATION; LINEAR ALGEBRA; MATHEMATICAL MODELS; PROBLEM SOLVING;

CONNECTED GRAPHS; EDGE CUTS; ORDER RESTRICTION; RESTRICTED EDGE CONNECTIVITY;

GRAPH THEORY;

EID: 28544453191     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.10.012     Document Type: Article

References (18)

1. D. Bauer Combinatorial optimization problem in analysis and design of probabilistic networks Networks 15 1985 257 271
2. J.A. Bondy, and U.S.R. Murty Graph Theory with Applications 1976 Macmillan Press London
3. P. Bonsma, N. Ueffing, and L. Volkmann Edge-cuts leaving components of order at least three Discrete Math. 256 2002 431 439
4. G.A. Dirac Some theorem on abstract graphs Proc. London Math. Soc. 2 1952 69 81
5. A.H. Esfahanian Generalized measures of fault tolerance with application to N-cube networks IEEE Trans. Comput. 38 1989 1586 1591
6. A.H. Esfahanian, and S.L. Hakimi On computing a conditional edge connectivity of a graph Inform. Proc. Lett. 27 1988 195 199
7. A. Hellwig, D. Rautenbach, L. Volkmann, Cuts leaving components of given minimal order, Discrete Math., to appear.
8. S. Latifi Conditional connectivity measure of large multiprocessor systems IEEE Trans. Comput. 43 1994 218 221
9. Q.L. Li, and Q. Li Reliability analysis of circulant graphs Networks 28 1998 61 65
10. J.X. Meng, and Y. Ji On a kind of restricted edge connectivity of graphs Discrete Appl. Math. 243 2002 291 298
11. J.P. Ou, Restricted edge connectivity and network reliability, Ph.D. Thesis, Department of Mathematics, Xiamen University, 2003.
12. J.P. Ou 4-restricted edge cut of graphs Austral. J. Combinatorics 30 2004 103 112
13. J.P. Ou, 3-restricted edge cut of graphs, Southeast Asian Bull. Math., to appear.
14. J.P. Ou, 4-restricted edge connectivity and network reliability, submitted for publication.
15. J.P. Ou, and F. Zhang 3-restricted edge connectivity of vertex transitive graphs Ars Combin. 74 2005 291 301
16. 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 777 788
17. Y.Q. Wang, Properties of high order edge connectivity of graphs and network reliability comparison, Ph.D. Thesis, Department of Mathematics, Shanghai Jiaotong University, 2001.
18. M. Wang, and Q. Li Conditional edge connectivity properties, reliability comparison and transitivity of graphs Discrete Math. 258 1-3 2002 205 214