메뉴 건너뛰기
Discrete Mathematics
Volumn 307, Issue 2, 2007, Pages 293-298
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
Author keywords

Isoperimetric edge connectivity; Restricted edge connectivity
Indexed keywords

OPTIMAL SYSTEMS; SET THEORY;
EID: 33845210152     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.06.028     Document Type: Article
Times cited : (37)
References (15)
  • 1
    • 0042143499 scopus 로고
    • On graphs with equal edge connectivity and minimum degree
    • Bollobás B. On graphs with equal edge connectivity and minimum degree. Discrete Math. 28 (1979) 321-323
    • (1979) Discrete Math. , vol.28 , pp. 321-323
    • Bollobás, B.1
  • 2
    • 31244435524 scopus 로고    scopus 로고
    • Edge-cuts leaving components of order at least three
    • Bonsma P., Ueffing N., and Volkmann L. Edge-cuts leaving components of order at least three. Discrete Math. 256 (2002) 431-439
    • (2002) Discrete Math. , vol.256 , pp. 431-439
    • Bonsma, P.1    Ueffing, N.2    Volkmann, L.3
  • 3
    • 0000757384 scopus 로고
    • A graph-theoretic approach to a communications problem
    • Chartrand G. A graph-theoretic approach to a communications problem. SIAM J. Appl. Math. 14 (1966) 778-781
    • (1966) SIAM J. Appl. Math. , vol.14 , pp. 778-781
    • Chartrand, G.1
  • 4
    • 0031518422 scopus 로고    scopus 로고
    • Degree sequence conditions for maximally edge-connected graphs and digraphs
    • Dankelmann P., and Volkmann L. Degree sequence conditions for maximally edge-connected graphs and digraphs. J. Graph Theory 26 (1997) 27-34
    • (1997) J. Graph Theory , vol.26 , pp. 27-34
    • Dankelmann, P.1    Volkmann, L.2
  • 5
    • 0024765312 scopus 로고
    • 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. IEEE Trans. Comput. 38 (1989) 1586-1591
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 1586-1591
    • Esfahanian, A.H.1
  • 6
    • 0024281477 scopus 로고
    • On computing a conditional edge connectivity of a graph
    • Esfahanian A.H., and Hakimi S.L. 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.1    Hakimi, S.L.2
  • 7
    • 0038899301 scopus 로고
    • On graphs with equal edge-connectivity and minimum degree
    • Goldsmith D.L., and White A.T. On graphs with equal edge-connectivity and minimum degree. Discrete Math. 23 (1978) 31-36
    • (1978) Discrete Math. , vol.23 , pp. 31-36
    • Goldsmith, D.L.1    White, A.T.2
  • 9
    • 0008393057 scopus 로고
    • Results on the edge-connectivity of graphs
    • Lesniak L. Results on the edge-connectivity of graphs. Discrete Math. 8 (1974) 351-354
    • (1974) Discrete Math. , vol.8 , pp. 351-354
    • Lesniak, L.1
  • 10
    • 0037421179 scopus 로고    scopus 로고
    • Optimally super-edge-connected transitive graphs
    • Meng J.X. Optimally super-edge-connected transitive graphs. Discrete Math. 260 (2003) 239-248
    • (2003) Discrete Math. , vol.260 , pp. 239-248
    • Meng, J.X.1
  • 11
    • 84867947324 scopus 로고    scopus 로고
    • On a kind of restricted edge connectivity of graphs
    • Meng J.X., and Ji Y.H. 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.X.1    Ji, Y.H.2
  • 12
    • 21144434889 scopus 로고    scopus 로고
    • Restricted edge-connectivity and minimum edge-degree
    • Ueffing N., and Volkmann L. Restricted edge-connectivity and minimum edge-degree. ARS Combin. 66 (2003) 193-203
    • (2003) ARS Combin. , vol.66 , pp. 193-203
    • Ueffing, N.1    Volkmann, L.2
  • 13
    • 0037032968 scopus 로고    scopus 로고
    • 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.1    Li, Q.2
  • 14
    • 0035435770 scopus 로고    scopus 로고
    • An Ore type sufficient condition for a graph to be super restricted edge-connected
    • Wang Y.Q., and Li Q. An Ore type sufficient condition for a graph to be super restricted edge-connected. J. Shanghai Jiaotong University 35 (2001) 1253-1255
    • (2001) J. Shanghai Jiaotong University , vol.35 , pp. 1253-1255
    • Wang, Y.Q.1    Li, Q.2
  • 15
    • 27944492031 scopus 로고    scopus 로고
    • A proof of an inequality concerning k-restricted edge connectivity
    • Zhang Z., and Yuan J.J. A proof of an inequality concerning k-restricted edge connectivity. Discrete Math. 304 (2005) 128-134
    • (2005) Discrete Math. , vol.304 , pp. 128-134
    • Zhang, Z.1    Yuan, J.J.2

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