메뉴 건너뛰기
Ars Combinatoria
Volumn 66, Issue , 2003, Pages 193-203
Restricted edge-connectivity and minimum edge-degree
Author keywords

Atoms; Edge connectivity; Products of graphs; Restricted edge connectivity; ' optimal graphs
Indexed keywords

EID: 21144434889     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (29)
References (5)
  • 1
    • 0024765312 scopus 로고
    • Generalized measures of fault tolerance with application to n-cube networks
    • A.-H. Esfahanian, 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
  • 2
    • 0024281477 scopus 로고
    • On computing a conditional edge-connectivity of a graph
    • A.-H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph, J. Inform. Processing Lett. 27 (1988), 195-199.
    • (1988) J. Inform. Processing Lett. , vol.27 , pp. 195-199
    • Esfahanian, A.-H.1    Hakimi, S.L.2
  • 3
    • 0039647017 scopus 로고    scopus 로고
    • The wide-diameter of the n-dimensional toroidal mesh
    • Y. Ishigami, The wide-diameter of the n-dimensional toroidal mesh, Networks 27 (1996), 257-266.
    • (1996) Networks , vol.27 , pp. 257-266
    • Ishigami, Y.1
  • 4
    • 0001263144 scopus 로고
    • An extremal problem in graph theory
    • in Hungarian
    • P. Turán, An extremal problem in graph theory, Mat.-Fiz. Lapok 48 (1941), 436-452 (in Hungarian).
    • (1941) Mat.-fiz. Lapok , vol.48 , pp. 436-452
    • Turán, P.1
  • 5
    • 85168541513 scopus 로고    scopus 로고
    • On restricted edge-connectivity of graphs
    • to appear
    • J.-M. Xu, On restricted edge-connectivity of graphs, Discrete Math., to appear.
    • Discrete Math.
    • Xu, J.-M.1

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