메뉴 건너뛰기




Volumn 22, Issue 1, 2006, Pages 43-48

Super connectivity of line graphs and digraphs

Author keywords

De Bruijn digraphs; Kautz digraphs; Line graphs; Super connectivity; Super edge connectivity

Indexed keywords


EID: 29144500423     PISSN: 01689673     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10255-005-0283-2     Document Type: Article
Times cited : (13)

References (15)
  • 1
    • 0002275818 scopus 로고
    • Connectivity extremal problems and the design of reliable probabilistic networks
    • Wiley, New York
    • Bauer, D., Boesch, F., Suffel, C., Tindell, R. Connectivity extremal problems and the design of reliable probabilistic networks. The Theory and Application of Graphs. Wiley, New York, 1981, 45-54
    • (1981) The Theory and Application of Graphs , pp. 45-54
    • Bauer, D.1    Boesch, F.2    Suffel, C.3    Tindell, R.4
  • 2
    • 84941474134 scopus 로고
    • Synthesis of reliable networks-A survey
    • Boesch, F.T. Synthesis of reliable networks-A survey. IEEE Trans. Reliability, 35: 240-246 (1986)
    • (1986) IEEE Trans. Reliability , vol.35 , pp. 240-246
    • Boesch, F.T.1
  • 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(11): 1586-1591 (1989)
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.11 , pp. 1586-1591
    • Esfahanian, A.H.1
  • 4
    • 0024281477 scopus 로고
    • On computing a conditional edge-connectivity of a graph
    • Esfahanian, A.H., Hakimi, S.L. On computing a conditional edge-connectivity of a graph. Information Processing Letters, 27: 195-199 (1988)
    • (1988) Information Processing Letters , vol.27 , pp. 195-199
    • Esfahanian, A.H.1    Hakimi, S.L.2
  • 5
    • 84986522954 scopus 로고
    • Maximally connected digraphs
    • Fábrega, J., Fiol, M.A. Maximally connected digraphs. J. Graph Theory, 13: 657-668 (1989)
    • (1989) J. Graph Theory , vol.13 , pp. 657-668
    • Fábrega, J.1    Fiol, M.A.2
  • 6
    • 0009001527 scopus 로고
    • Short paths and connectivity in graphs and digraphs
    • Fiol, M.A., Fábrega, J., Escudero, M. Short paths and connectivity in graphs and digraphs. Ars Combin., 29B: 253-256 (1990)
    • (1990) Ars Combin. , vol.29 B , pp. 253-256
    • Fiol, M.A.1    Fábrega, J.2    Escudero, M.3
  • 7
    • 0022024631 scopus 로고
    • Connectivity of regular digraphs with small diameters
    • Imase, M., Soneoka, T., Okada, K. Connectivity of regular digraphs with small diameters. IEEE Trans. Comput., 34: 267-273 (1985)
    • (1985) IEEE Trans. Comput. , vol.34 , pp. 267-273
    • Imase, M.1    Soneoka, T.2    Okada, K.3
  • 8
    • 0028377873 scopus 로고
    • Conditional connectivity measures for large miltiprocessor systems
    • Latifi, S., Hegde, M., Naraghi-Pour, M. Conditional connectivity measures for large miltiprocessor systems. IEEE Trans. Comput., 43: 218-221 (1994)
    • (1994) IEEE Trans. Comput. , vol.43 , pp. 218-221
    • Latifi, S.1    Hegde, M.2    Naraghi-Pour, M.3
  • 9
    • 84867947324 scopus 로고    scopus 로고
    • On a kind of restricted edge connectivity of graphs
    • Meng, J.X., Ji, Y.H. On a kind of restricted edge connectivity of graphs. Discrete Applied Math., 117: 183-193 (2002)
    • (2002) Discrete Applied Math. , vol.117 , pp. 183-193
    • Meng, J.X.1    Ji, Y.H.2
  • 10
    • 38249013054 scopus 로고
    • Super edge-connectivity of dense digraphs and graphs
    • Soneoka, T. Super edge-connectivity of dense digraphs and graphs. Discrete Applied. Math., 37/38: 511-523 (1992)
    • (1992) Discrete Applied. Math. , vol.37-38 , pp. 511-523
    • Soneoka, T.1
  • 11
    • 0037032968 scopus 로고    scopus 로고
    • Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
    • Wang, M., Li, Q. Conditional edge connectivity properties, reliability comparisons and transitivity of graphs. Discrete Math., 258: 205-214 (2002)
    • (2002) Discrete Math. , vol.258 , pp. 205-214
    • Wang, M.1    Li, Q.2
  • 13
    • 15844427029 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Dordrecht, Boston, London
    • Xu, J.M. Theory and application of graphs. Kluwer Academic Publishers, Dordrecht, Boston, London, 2003
    • (2003) Theory and Application of Graphs
    • Xu, J.M.1
  • 14
    • 29144515511 scopus 로고    scopus 로고
    • The restricted edge-connectivity of de Bruijn digraphs
    • Xu, J.M., Lu, M. The restricted edge-connectivity of de Bruijn digraphs. Ars Combinatoria, 75: 490-498 (2005)
    • (2005) Ars Combinatoria , vol.75 , pp. 490-498
    • Xu, J.M.1    Lu, M.2
  • 15
    • 31244433586 scopus 로고    scopus 로고
    • On restricted edge-connectivity of graphs
    • Xu, J.M., Xu, K.L. On restricted edge-connectivity of graphs. Discrete Math., 243: 291-298 (2002)
    • (2002) Discrete Math. , vol.243 , pp. 291-298
    • Xu, J.M.1    Xu, K.L.2


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