메뉴 건너뛰기
Information Processing Letters
Volumn 103, Issue 6, 2007, Pages 234-239
Restricted arc-connectivity of digraphs
Author keywords

Arc connectivity; Complexity; Edge connectivity; Fault tolerance; Restricted arc connectivity; Restricted edge connectivity
Indexed keywords

COMPUTATIONAL COMPLEXITY; FAULT TOLERANCE; INTERCONNECTION NETWORKS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;
EID: 34250886280     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.04.004     Document Type: Article
Times cited : (35)
References (12)
  • 3
    • 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
  • 4
    • 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
  • 5
    • 0020827886 scopus 로고
    • Conditional connectivity
    • Harary F. Conditional connectivity. Networks 13 (1983) 347-357
    • (1983) Networks , vol.13 , pp. 347-357
    • Harary, F.1
  • 6
    • 2442654399 scopus 로고    scopus 로고
    • ′-optimality in graphs of diameter 2
    • ′-optimality in graphs of diameter 2. Discrete Math. 283 (2004) 113-120
    • (2004) Discrete Math. , vol.283 , pp. 113-120
    • Hellwig, A.1    Volkmann, L.2
  • 7
    • 14644395517 scopus 로고    scopus 로고
    • ′-optimal, super-edge-connected and maximally edge-connected
    • ′-optimal, super-edge-connected and maximally edge-connected. J. Graph Theory 48 (2005) 228-246
    • (2005) J. Graph Theory , vol.48 , pp. 228-246
    • Hellwig, A.1    Volkmann, L.2
  • 8
    • 0039992140 scopus 로고    scopus 로고
    • Reliability analysis of circulant graphs
    • Li Q.L., and Li Q. Reliability analysis of circulant graphs. Networks 31 (1998) 61-65
    • (1998) Networks , vol.31 , pp. 61-65
    • Li, Q.L.1    Li, Q.2
  • 9
    • 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
  • 10
    • 34250837737 scopus 로고    scopus 로고
    • A sufficient condition for an equality between restricted edge-connectivity and minimum edge-degree of graphs
    • (in Chinese and English, Chinese summary)
    • Wang Y.Q., and Li Q. A sufficient condition for an equality between restricted edge-connectivity and minimum edge-degree of graphs. Appl. Math. J. Chinese Univ. Ser. A 16 (2001) 269-275 (in Chinese and English, Chinese summary)
    • (2001) Appl. Math. J. Chinese Univ. Ser. A , vol.16 , pp. 269-275
    • Wang, Y.Q.1    Li, Q.2
  • 11
    • 0000652549 scopus 로고    scopus 로고
    • Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
    • Wu J., and Guo G. Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets. IEEE Trans. Comput. 47 (1998) 888-893
    • (1998) IEEE Trans. Comput. , vol.47 , pp. 888-893
    • Wu, J.1    Guo, G.2
  • 12
    • 31244433586 scopus 로고    scopus 로고
    • 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.1    Xu, K.-L.2

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