SCOPUS 정보 검색 플랫폼

Volumn 21, Issue 4, 2005, Pages 459-467

Super restricted edge connectivity of regular graphs

Author keywords

Edge connectivity; Edge cut counting; Regular graph

Indexed keywords

EID: 31844451541 PISSN: 09110119 EISSN: None Source Type: Journal
DOI: 10.1007/s00373-005-0600-9 Document Type: Review

Times cited : (15)

References (12)

1
- 0000166629
- The complexity of counting cuts and of computing the probability that a graph is connected
- Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Comput. 12, 777-788 (1983)
- (1983) SIAM Comput. , vol.12 , pp. 777-788
- Provan, J.S.¹ Ball, M.O.²

2
- 0022077498
- Combinatorial optimization problem in the analysis and design of probabilistic networks
- Bauer, D., Boesch, F., Suffel, C., et al,: Combinatorial optimization problem in the analysis and design of probabilistic networks. Networks, 15, 257-271 (1985)
- (1985) Networks , vol.15 , pp. 257-271
- Bauer, D.¹ Boesch, F.² Suffel, C.³

3
- 0024281477
- On computing a conditional edge connectivity of a graph
- Esfahanian, A.H., Hakimi, H.L.: On computing a conditional edge connectivity of a graph. J. In. Process. Letters, 27, 195-199 (1988)
- (1988) J. In. Process. Letters , vol.27 , pp. 195-199
- Esfahanian, A.H.¹ Hakimi, H.L.²

4
- 0024765312
- Generalized measures of fault tolerance with application to N-cube networks
- Esfahanian, A.H.: Generalized measures of fault tolerance with application to N-cube networks. J IEEE Trans. Comput. 38, 1586-1591 (1989)
- (1989) J IEEE Trans. Comput. , vol.38 , pp. 1586-1591
- Esfahanian, A.H.¹

5
- 0039992140
- Reliability analysis of circulant graphs
- Li, Q.L., Li, Q.: Reliability analysis of circulant graphs. Networks, 28, 61-65 (1998)
- (1998) Networks , vol.28 , pp. 61-65
- Li, Q.L.¹ Li, Q.²

6
- 27944463035
- Ph.D. Thesis, Department of Mathmetics, Shanghai Jiaotong University, China
- Wang, Y.Q.: Properies of high order edge connectivity of graphs and network reliability comparison. Ph.D. Thesis, Department of Mathmetics, Shanghai Jiaotong University, China 2001
- (2001) Properies of High Order Edge Connectivity of Graphs and Network Reliability Comparison
- Wang, Y.Q.¹

7
- 31244433586
- On restricted edge connectivity of graphs
- Xu, J.M., Xu, K.L.: On restricted edge connectivity of graphs. Discrete Math. 243, 291-298 (2002)
- (2002) Discrete Math. , vol.243 , pp. 291-298
- Xu, J.M.¹ Xu, K.L.²

8
- 31844448205
- private communication
- Li, Q.: On comparison and optimization problems of reliable networks for sufficiently small edge failure probability, private communication
- On Comparison and Optimization Problems of Reliable Networks for Sufficiently Small Edge Failure Probability
- Li, Q.¹

9
- 84867947324
- On a kind of restricted edge connectivity of graphs
- Men, J.X., Ji, Y.: On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117(1-3), 183-193 (2002)
- (2002) Discrete Appl. Math. , vol.117 , Issue.1-3 , pp. 183-193
- Men, J.X.¹ Ji, Y.²

10
- 31244435524
- Edge-cuts leaving components of order at least three
- Bonsma, P., Ueffing, N., Volkmann, L.: Edge-cuts leaving components of order at least three. Discrete Math. 256, 431-439 (2002)
- (2002) Discrete Math. , vol.256 , pp. 431-439
- Bonsma, P.¹ Ueffing, N.² Volkmann, L.³

11
- 0141764680
- Super edge- and point-connectivity of the cartesian product of regular graphs
- Shieh, B.S.: Super edge- and point-connectivity of the cartesian product of regular graphs. Networks, 40, 91-96 (2002)
- (2002) Networks , vol.40 , pp. 91-96
- Shieh, B.S.¹

12
- 0003524084
- New York: North-Holland
- Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications, New York: North-Holland 1976
- (1976) Graph Theory with Applications
- Bondy, J.A.¹ Murty, U.S.R.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.