메뉴 건너뛰기




Volumn 258, Issue 1-3, 2002, Pages

Conditional edge connectivity properties, reliability comparisons and transitivity of graphs

Author keywords

Conditional edge connectivity; Edge transitive; Locally the most reliable; Vertex transitive

Indexed keywords


EID: 0037032968     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00299-6     Document Type: Article
Times cited : (94)

References (20)
  • 1
    • 9344256026 scopus 로고    scopus 로고
    • Extraconnectivity of s-geodetic digraphs and graphs
    • C. Balbuena, Extraconnectivity of s-geodetic digraphs and graphs, Discrete Math. 195 (1999) 39-52.
    • (1999) Discrete Math. , vol.195 , pp. 39-52
    • Balbuena, C.1
  • 2
    • 0039976081 scopus 로고    scopus 로고
    • Extraconnectivity of graphs with large minimum degree and girth
    • C. Balbuena, A: Carmona, J. Fàbreca, M.A. Fiol, Extraconnectivity of graphs with large minimum degree and girth, Discrete Math. 167/168 (1997) 85-100.
    • (1997) Discrete Math. , vol.167-168 , pp. 85-100
    • Balbuena, C.1    Carmona, A.2    Fàbreca, J.3    Fiol, M.A.4
  • 3
    • 0002275818 scopus 로고
    • Connectivity extremal problems and the design of reliable probabilistic networks
    • Wiley, New York
    • D. Bauer, F. Boesch, C. Suffel, R. Tindell, Connectivity extremal problems and the design of reliable probabilistic networks, The Theory and Application of Graphs, Wiley, New York, 1981, pp. 89-98.
    • (1981) The Theory and Application of Graphs , pp. 89-98
    • Bauer, D.1    Boesch, F.2    Suffel, C.3    Tindell, R.4
  • 4
    • 84986472097 scopus 로고
    • On unreliability polynomials and graph connectivity in reliable network synthesis
    • F. Boesch, On unreliability polynomials and graph connectivity in reliable network synthesis, J. Graph Theory 10 (1986) 339-352.
    • (1986) J. Graph Theory , vol.10 , pp. 339-352
    • Boesch, F.1
  • 5
    • 84986938801 scopus 로고
    • On the existence of uniformly optimally reliable networks
    • F. Boesch, X. Li, C. Suffel, On the existence of uniformly optimally reliable networks, Networks 21 (1991) 181-194.
    • (1991) Networks , vol.21 , pp. 181-194
    • Boesch, F.1    Li, X.2    Suffel, C.3
  • 6
    • 84986495442 scopus 로고
    • Circulants and their connectivities
    • F. Boesch, R. Tindell, Circulants and their connectivities, J. Graph Theory 8 (1984) 487-499.
    • (1984) J. Graph Theory , vol.8 , pp. 487-499
    • Boesch, F.1    Tindell, R.2
  • 8
    • 0024765312 scopus 로고
    • Generalized measures of fault tolerance with applications to n-cubes networks
    • A. Esfahanian, Generalized measures of fault tolerance with applications to n-cubes networks, IEEE Trans. Comput. 38 (1989) 1586-1591.
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 1586-1591
    • Esfahanian, A.1
  • 9
    • 0024281477 scopus 로고
    • On computing a conditional edge connectivity of a graph, Inform
    • A. Esfahanian, S. Hakimi, On computing a conditional edge connectivity of a graph, Inform. Process. Lett. 27 (1988) 195-199.
    • (1988) Process. Lett. , vol.27 , pp. 195-199
    • Esfahanian, A.1    Hakimi, S.2
  • 10
    • 0040223169 scopus 로고
    • Extraconnectivity of graphs with large girth
    • J. Fàbrega, M.A. Fiol, Extraconnectivity of graphs with large girth, Discrete Math. 127 (1994) 163 -170.
    • (1994) Discrete Math. , vol.127 , pp. 163-170
    • Fàbrega, J.1    Fiol, M.A.2
  • 11
    • 17944395031 scopus 로고    scopus 로고
    • On the extraconnectivity of graphs
    • J. Fàbrega, M.A. Fiol, On the extraconnectivity of graphs, Discrete Math. 155 (1996) 49-57.
    • (1996) Discrete Math. , vol.155 , pp. 49-57
    • Fàbrega, J.1    Fiol, M.A.2
  • 12
    • 0001387806 scopus 로고
    • Sur les atomes d'un graphe orienté
    • Y.O. Hamidoune, Sur les atomes d'un graphe orienté, C. R. Acad. Sci. Paris 284-A (1977) 1253-1256.
    • (1977) C. R. Acad. Sci. Paris , vol.284 A , pp. 1253-1256
    • Hamidoune, Y.O.1
  • 13
    • 0039978445 scopus 로고
    • A property of α-fragments of a digraph
    • Y.O. Hamidoune, A property of α-fragments of a digraph, Discrete Math. 31 (1980) 105-106.
    • (1980) Discrete Math. , vol.31 , pp. 105-106
    • Hamidoune, Y.O.1
  • 14
    • 33845893262 scopus 로고    scopus 로고
    • Master Thesis, Shanghai Jiao Tong University
    • X.Y. Huang, Master Thesis, Shanghai Jiao Tong University, 2000.
    • (2000)
    • Huang, X.Y.1
  • 15
    • 0033095304 scopus 로고    scopus 로고
    • Super edge connectivity properties of connected edge symmetric graphs
    • Q.L. Li, Q. Li, Super edge connectivity properties of connected edge symmetric graphs, Networks 33 (1999) 157-159.
    • (1999) Networks , vol.33 , pp. 157-159
    • Li, Q.L.1    Li, Q.2
  • 17
    • 0002601802 scopus 로고
    • Minimale n-fach kantenzusammenhängenden Graphen
    • W. Mader, Minimale n-fach kantenzusammenhängenden Graphen, Math. Ann. 191 (1971) 21-28.
    • (1971) Math. Ann. , vol.191 , pp. 21-28
    • Mader, W.1
  • 19
    • 33845872756 scopus 로고    scopus 로고
    • Ph.D. Thesis, Shanghai Jiao Tong University
    • Y.Q. Wang, Ph.D. Thesis, Shanghai Jiao Tong University, 2001.
    • (2001)
    • Wang, Y.Q.1
  • 20
    • 0002443025 scopus 로고
    • Connectivity of transitive graphs
    • M.E. Watkins, Connectivity of transitive graphs, J. Combin. Theory 8 (1970) 23-29.
    • (1970) J. Combin. Theory , vol.8 , pp. 23-29
    • Watkins, M.E.1


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