4-restricted edge cuts of graphs

Australasian Journal of Combinatorics

Volumn 30, Issue , 2004, Pages 103-112

  Jianping, Ou ^a  

^a MINNAN NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 28544444492     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. J.S. Provan and M.O. Ball, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM J. Computing 12 (1983), 777-788.
2. D. Bauer, F. Boesch, C. Suffel and R. Tindell, Combinatorial optimization problems in the analysis and design of probabilistic networks, Networks 15 (1985), 257-271.
3. A.H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform. Process. Lett. 27 (1988), 195-199.
4. Q.L. Li and Q. Li, Reliability analysis of circulant graphs, Networks 28 (1998), 61-65.
5. J.P. Ou, m-restricted edge connectivity and network reliability, Ph. D Thesis, Department of Mathematics, Xiamen University, China, 2002.
6. J.X. Meng and Y. Ji, On a kind of restricted edge connectivity of graphs, Discrete Appl. Math. 243 (2002), 291-298.
7. M. Wang and Q. Li, Conditional edge connectivity properties, reliability comparison and transitivity of graphs, Discrete Math. 258 (2002), 205-214.
8. J. Wu and G. Guo, Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets, IEEE Trans. Comput. 47 (1998), 888-893.
9. J. Xu, Restricted edge connectivity of vertex transitive graphs, Chin. Ann. Math. 5 (2000), 605-608 (in Chinese).
10. J.P. Ou, 3-restricted edge cut of graphs, to appear in Southeast Asian Bulletin of Mathematics.
11. J.A. Bondy and U.S.R. Murty, Graph theory with Applications, Macmillan Press, London, 1976.