메뉴 건너뛰기
Discrete Mathematics
Volumn 309, Issue 4, 2009, Pages 629-638
On 3-restricted edge connectivity of undirected binary Kautz graphs
Author keywords

Kautz graph; Restricted edge connectivity
Indexed keywords

CONNECTED GRAPHS; EDGE CUTS; KAUTZ GRAPH; RESTRICTED EDGE CONNECTIVITY; RESTRICTED EDGE CUTS; TWO COMPONENTS;
EID: 60149085574     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.12.079     Document Type: Article
Times cited : (6)
References (17)
  • 2
    • 0022077498 scopus 로고
    • Combinatorial optimization problems in analysis and design of probabilistic networks
    • Bauer D., Boesch F., Suffel C., et al. Combinatorial optimization problems in analysis and design of probabilistic networks. Networks 15 (1985) 257-271
    • (1985) Networks , vol.15 , pp. 257-271
    • Bauer, D.1    Boesch, F.2    Suffel, C.3
  • 3
    • 0041765234 scopus 로고
    • Diameter and reliability of some large interconnection networks
    • Bond J.B., and Peyrat C. Diameter and reliability of some large interconnection networks. Congr. Numer. 66 (1988) 267-282
    • (1988) Congr. Numer. , vol.66 , pp. 267-282
    • Bond, J.B.1    Peyrat, C.2
  • 5
    • 0041494566 scopus 로고    scopus 로고
    • The spectrum of de Bruijn and Kautz graphs
    • Delorme C., and Jean-Pierre T. The spectrum of de Bruijn and Kautz graphs. European J. Combin. 19 (1998) 307-319
    • (1998) European J. Combin. , vol.19 , pp. 307-319
    • Delorme, C.1    Jean-Pierre, T.2
  • 6
    • 31244434315 scopus 로고    scopus 로고
    • On the connectivity of consecutive-d digraphs
    • Du D.Z., Hsu D.F., Hung Q.N., et al. On the connectivity of consecutive-d digraphs. Discrete Math. 257 (2002) 371-384
    • (2002) Discrete Math. , vol.257 , pp. 371-384
    • Du, D.Z.1    Hsu, D.F.2    Hung, Q.N.3
  • 7
    • 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
  • 8
    • 0020827886 scopus 로고
    • Conditional connectivity
    • Harary F. Conditional connectivity. Networks 13 (1983) 346-357
    • (1983) Networks , vol.13 , pp. 346-357
    • Harary, F.1
  • 9
    • 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
  • 10
    • 0024716107 scopus 로고
    • Fault-tolerant routings in Kautz and de Bruijn networks
    • Homobono N., and Peyrat C. Fault-tolerant routings in Kautz and de Bruijn networks. Discrete Appl. Math. 24 (1989) 179-186
    • (1989) Discrete Appl. Math. , vol.24 , pp. 179-186
    • Homobono, N.1    Peyrat, C.2
  • 11
    • 0039992140 scopus 로고    scopus 로고
    • Reliability analysis of circulant graphs
    • Li Q.L., and Li Q. Reliability analysis of circulant graphs. Networks 28 (1998) 61-65
    • (1998) Networks , vol.28 , pp. 61-65
    • Li, Q.L.1    Li, Q.2
  • 12
    • 60149097302 scopus 로고    scopus 로고
    • Restricted connectivity and restricted diameter of undirected Kautz graphs
    • Li Q., and Zhang Y. Restricted connectivity and restricted diameter of undirected Kautz graphs. J. Shanghai Jiaotong Univ. 31 2 (1997) 1-6
    • (1997) J. Shanghai Jiaotong Univ. , vol.31 , Issue.2 , pp. 1-6
    • Li, Q.1    Zhang, Y.2
  • 13
    • 84867947324 scopus 로고    scopus 로고
    • On a kind of restricted edge connectivity of graphs
    • Men J.X., and Ji Y. On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117 1-3 (2002) 183-193
    • (2002) Discrete Appl. Math. , vol.117 , Issue.1-3 , pp. 183-193
    • Men, J.X.1    Ji, Y.2
  • 14
    • 28544453191 scopus 로고    scopus 로고
    • Edge cuts leaving components of order at least m
    • Ou J.P. Edge cuts leaving components of order at least m. Discrete Math. 305 (2005) 365-371
    • (2005) Discrete Math. , vol.305 , pp. 365-371
    • Ou, J.P.1
  • 15
    • 44449158938 scopus 로고    scopus 로고
    • Restricted edge connectivity of Kautz graphs
    • Ou J.P. Restricted edge connectivity of Kautz graphs. Chinese Quart. J. Math. 1 (2004) 47-50
    • (2004) Chinese Quart. J. Math. , vol.1 , pp. 47-50
    • Ou, J.P.1
  • 16
    • 0000166629 scopus 로고
    • The complexity of counting cuts and of computing the probability that a graph is connected
    • Provan J.S., and Ball M.O. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12 (1983) 777-788
    • (1983) SIAM J. Comput. , vol.12 , pp. 777-788
    • Provan, J.S.1    Ball, M.O.2
  • 17
    • 0037032968 scopus 로고    scopus 로고
    • Conditional edge connectivity properties, reliability comparison and transitivity of graphs
    • Wang M., and Li Q. Conditional edge connectivity properties, reliability comparison and transitivity of graphs. Discrete Math. 258 (2002) 205-214
    • (2002) Discrete Math. , vol.258 , pp. 205-214
    • Wang, M.1    Li, Q.2

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