메뉴 건너뛰기




Volumn 45, Issue 3, 2005, Pages 113-118

On restricted connectivities of permutation graphs

Author keywords

Connectivity; Permutation graph; Restricted connectivity; Restricted cut; Restricted edge cut; Superconnectivity

Indexed keywords

COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

EID: 17644394213     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20056     Document Type: Article
Times cited : (30)

References (15)
  • 1
    • 0039976081 scopus 로고    scopus 로고
    • Extraconnectivity of graphs with large minimum degree and girth
    • C. Balbuena, A. Carmona, J. Fàbrega, and M.A. Fiol, Extraconnectivity of graphs with large minimum degree and girth, Discr Math 167/168(1997), 85-100.
    • (1997) Discr Math , vol.167-168 , pp. 85-100
    • Balbuena, C.1    Carmona, A.2    Fàbrega, J.3    Fiol, M.A.4
  • 2
    • 84941474134 scopus 로고
    • Synthesis of reliable networks - A survey
    • F.T. Boesch, Synthesis of reliable networks - A survey, IEEE Trans Reliab 35 (1986), 240-246.
    • (1986) IEEE Trans Reliab , vol.35 , pp. 240-246
    • Boesch, F.T.1
  • 3
    • 84986495442 scopus 로고
    • Circulants and their connectivities
    • F.T. Boesch and R. Tindell, Circulants and their connectivities, J Graph Theory 8 (1984), 487-499.
    • (1984) J Graph Theory , vol.8 , pp. 487-499
    • Boesch, F.T.1    Tindell, R.2
  • 6
    • 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, Inf Process Lett 27 (1988), 195-199.
    • (1988) Inf Process Lett , vol.27 , pp. 195-199
    • Esfahanian, A.H.1    Hakimi, S.L.2
  • 7
    • 17944395031 scopus 로고    scopus 로고
    • On the extraconnectivity of graphs
    • J. Fàbrega and M.A. Fiol, On the extraconnectivity of graphs, Discr Math 155 (1996), 49-57.
    • (1996) Discr Math , vol.155 , pp. 49-57
    • Fàbrega, J.1    Fiol, M.A.2
  • 8
    • 0009001527 scopus 로고
    • Short paths and connectivity in graphs and digraphs
    • M.A. Fiol, J. Fàbrega, and M. Escudero, Short paths and connectivity in graphs and digraphs, Ars Combin 29B (1990), 17-31.
    • (1990) Ars Combin , vol.29 B , pp. 17-31
    • Fiol, M.A.1    Fàbrega, J.2    Escudero, M.3
  • 9
    • 0042389569 scopus 로고    scopus 로고
    • Distance and connectivity measures in permutation graphs
    • W. Goddard, M.E. Raines, and P.J. Slater, Distance and connectivity measures in permutation graphs, Discr Math 271 (2003), 61-70.
    • (2003) Discr Math , vol.271 , pp. 61-70
    • Goddard, W.1    Raines, M.E.2    Slater, P.J.3
  • 10
    • 0033130497 scopus 로고    scopus 로고
    • On diameter of permutation graphs
    • W. Gu, On diameter of permutation graphs, Networks 33 (1999), 161-166.
    • (1999) Networks , vol.33 , pp. 161-166
    • Gu, W.1
  • 11
    • 0020827886 scopus 로고
    • Conditional connectivity
    • F. Harary, Conditional connectivity, Networks 13 (1983), 347-357.
    • (1983) Networks , vol.13 , pp. 347-357
    • Harary, F.1
  • 12
    • 0041461551 scopus 로고
    • Large survivable nets and the generalized prisms
    • H.-J. Lai, Large survivable nets and the generalized prisms, Discr Appl Math 61 (1995), 181-185.
    • (1995) Discr Appl Math , vol.61 , pp. 181-185
    • Lai, H.-J.1
  • 13
    • 0042964487 scopus 로고
    • Edge-connectivity of permutation graphs
    • B. Piazza, Edge-connectivity of permutation graphs, Congr Numer 65 (1988), 7-16.
    • (1988) Congr Numer , vol.65 , pp. 7-16
    • Piazza, B.1
  • 14
    • 0009261806 scopus 로고
    • Connectivity of generalized prisms over G
    • B.L. Piazza and R.D. Ringeisen, Connectivity of generalized prisms over G, Discr Appl Math 30 (1991), 229-233.
    • (1991) Discr Appl Math , vol.30 , pp. 229-233
    • Piazza, B.L.1    Ringeisen, R.D.2


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