A proof of an inequality concerning k-restricted edge connectivity

Discrete Mathematics

Volumn 304, Issue 1-3, 2005, Pages 128-134

  Zhang, Zhao ^a,b   Yuan, Jinjiang ^a  

^a ZHENGZHOU UNIVERSITY   (China)

^b XINJIANG UNIVERSITY   (China)

Author keywords

K Restricted edge connectivity; K Restricted edge cut; Minimum degree

Indexed keywords

SET THEORY;

K-RESTRICTED EDGE CONNECTIVITY; K-RESTRICTED EDGE CUT; MINIMUM DEGREE;

GRAPH THEORY;

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

References (15)

1. D. Bauer, F. Boesch, C. Suffel, and R. Van Slyke On the validity of a reduction of reliable network design to a graph extremal problem IEEE Trans. Circuits and Systems 34 1989 1579 1581
2. P. Bonsma, N. Ueffing, and L. Volkmann Edge-cuts leaving components of order at least three Discrete Math. 256 2002 431 439
3. C.J. Colbourn The Combinatorics of Network Reliability 1987 Oxford University Press New York, Oxford
4. A. Esfahanian, and S. Hakimi On computing a conditional edge connectivity of a graph Inform. Process. Lett. 27 1988 195 199
5. J. Fàbrega, and M.A. Foil On the extraconnectivity of graphs Discrete Math. 155 1996 49 57
6. Q.L. Li, and Q. Li Super edge connectivity of connected edge symmetric graphs Networks 33 1999 157 159
7. L. Lovász Combinatorial Problems and Exercises 1979 North-Holland Publishing Company Amsterdam, New York, Oxford
8. J.X. Meng Optimally super-edge-connected transitive graphs Discrete Math. 260 2003 239 248
9. J.X. Meng, and Y.H. Ji On a kind of restricted edge connectivity of graphs Discrete Appl. Math. 117 2002 183 193
10. J.P. Ou, Restricted edge connectivity and network reliability, Doctoral Dissertation, Xiamen University, 2003.
11. 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
12. M. Wang, and Q. Li Conditional edge connectivity properties, reliability comparison and transitivity of graphs Discrete Math. 258 2002 205 214
13. Y.Q. Wang, Properties of high order edge connectivity of graphs and network reliability comparison, Doctoral Dissertation, Shanghai Jiaotong University, 2001.
14. J.M. Xu, and K.L. Xu On restricted edge-connectivity of graphs Discrete Math. 243 2002 291 298
15. Z. Zhang, Study on network reliability: graphs with higher order connectedness, Doctoral Dissertation, Xinjiang University, 2003.