SCOPUS 정보 검색 플랫폼

Volumn 307, Issue 19-20, 2007, Pages 2429-2437

A bound on 4-restricted edge connectivity of graphs

Author keywords

Edge connectivity; Graph; Vertex transitive

Indexed keywords

COMPUTATIONAL METHODS; NUMBER THEORY; THEOREM PROVING;

EDGE CONNECTIVITY; SUBGRAPH; VERTEX-TRANSITIVE;

GRAPH THEORY;

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

Times cited : (15)

References (15)

1
- 0022077498
- Combinatorial optimization problems in analysis and design of probabilistic networks
- Bauer D., et al. Combinatorial optimization problems in analysis and design of probabilistic networks. Networks 15 (1985) 257-271
- (1985) Networks , vol.15 , pp. 257-271
- Bauer, D.¹

2
- 0001797853
- Super line connectivity properties of circulant graphs
- Boesch F., and Wang J. Super line connectivity properties of circulant graphs. SIAM J. Algebraic Discrete Math. 1 (1986) 89-98
- (1986) SIAM J. Algebraic Discrete Math. , vol.1 , pp. 89-98
- Boesch, F.¹ Wang, J.²

3
- 0003524084
- Macmillan, London
- Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), Macmillan, London
- (1976) Graph Theory with Applications
- Bondy, J.A.¹ Murty, U.S.R.²

4
- 0024281477
- On computing a conditional edge connectivity of a graph
- Esfahanian A.H., and Hakimi S.L.K. On computing a conditional edge connectivity of a graph. Inform. Process. Lett. 27 (1988) 195-199
- (1988) Inform. Process. Lett. , vol.27 , pp. 195-199
- Esfahanian, A.H.¹ Hakimi, S.L.K.²

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

6
- 0002601802
- Minmale n-fach kantenzusammenha{combining double acute accent}ngende Graphen
- Mader W. Minmale n-fach kantenzusammenha{combining double acute accent}ngende Graphen. Math. Ann. 191 (1971) 21-28
- (1971) Math. Ann. , vol.191 , pp. 21-28
- Mader, W.¹

7
- 84867947324
- On a kind of restricted edge connectivity of graphs
- Meng J., and Ji Y. On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117 (2002) 183-193
- (2002) Discrete Appl. Math. , vol.117 , pp. 183-193
- Meng, J.¹ Ji, Y.²

8
- 85010248741
- Reliable circuits using less reliable relays (I)
- Moore E.F., and Shannon C. Reliable circuits using less reliable relays (I). J. Franklin Inst. 262 3 (1956) 191-208
- (1956) J. Franklin Inst. , vol.262 , Issue.3 , pp. 191-208
- Moore, E.F.¹ Shannon, C.²

9
- 85010220420
- Reliable circuits using less reliable relays (II)
- Moore E.F., and Shannon C. Reliable circuits using less reliable relays (II). J. Franklin Inst. 262 4 (1956) 281-297
- (1956) J. Franklin Inst. , vol.262 , Issue.4 , pp. 281-297
- Moore, E.F.¹ Shannon, C.²

10
- 34547929841
- J.P. Ou, m-Restricted edge connectivity of graphs and network reliability, Ph.D. Thesis, Department of Mathematics, Xiamen University, 2003.

11
- 28544444492
- 4-Restricted edge cuts of graphs
- Ou J.P. 4-Restricted edge cuts of graphs. Australasian J. Combin. 30 (2004) 103-112
- (2004) Australasian J. Combin. , vol.30 , pp. 103-112
- Ou, J.P.¹

12
- 28544453191
- Edge cuts leaving components of order at least m
- Ou J.P. Edge cuts leaving components of order at least m. Discrete Math. 305 (2005) 365-371
- (2005) Discrete Math. , vol.305 , pp. 365-371
- Ou, J.P.¹

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

14
- 0037032968
- Conditional edge connectivity properties, reliability comparison and transitivity of graphs
- Wang M., and Li Q. Conditional edge connectivity properties, reliability comparison and transitivity of graphs. Discrete Math. 258 (2002) 205-214
- (2002) Discrete Math. , vol.258 , pp. 205-214
- Wang, M.¹ Li, Q.²

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

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