메뉴 건너뛰기




Volumn 160, Issue 4-5, 2012, Pages 579-587

Edge fault tolerance of graphs with respect to super edge connectivity

Author keywords

Cartesian product graph; Edge transitive graph; Fault tolerance; Super edge connected

Indexed keywords

CARTESIAN PRODUCT GRAPH; CONNECTED GRAPH; EDGE CUTS; EDGE FAULT TOLERANCE; EDGE TRANSITIVE GRAPH; GRAPH G; REGULAR GRAPHS; SUPER EDGE CONNECTED; SUPER EDGE-CONNECTIVITY;

EID: 84856099657     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.10.033     Document Type: Article
Times cited : (21)

References (30)
  • 1
    • 34250833453 scopus 로고
    • A group theoretic model for symmetric interconnection networks
    • S. Akers, and B. Krishnamurthy A group theoretic model for symmetric interconnection networks IEEE Trans. Comput. 38 1989 555 566
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 555-566
    • Akers, S.1    Krishnamurthy, B.2
  • 2
    • 35449006311 scopus 로고    scopus 로고
    • On the edge-connectivity and restricted edge-connectivity of a product of graphs
    • DOI 10.1016/j.dam.2007.06.014, PII S0166218X07002259
    • C. Balbuena, M. Cera, A. Dinez, P. Garca-Vzquez, and X. Marcote On the edge-connectivity and restricted edge-connectivity of a product of graphs Discrete Appl. Math. 155 2007 2444 2455 (Pubitemid 47628779)
    • (2007) Discrete Applied Mathematics , vol.155 , Issue.18 , pp. 2444-2455
    • Balbuena, C.1    Cera, M.2    Dianez, A.3    Garcia-Vazquez, P.4    Marcote, X.5
  • 3
    • 61849170576 scopus 로고    scopus 로고
    • On the 3-restricted edge connectivity of permutation graphs
    • C. Balbuena, D. Gonzlez-Moreno, and X. Marcote On the 3-restricted edge connectivity of permutation graphs Discrete Appl. Math. 157 2009 1586 1591
    • (2009) Discrete Appl. Math. , vol.157 , pp. 1586-1591
    • Balbuena, C.1    Gonzlez-Moreno, D.2    Marcote, X.3
  • 5
    • 0002275818 scopus 로고
    • Connectivity extremal problems and the design of reliable probabilistic networks
    • Wiley New York
    • D. Bauer, F. Boesch, C. Suffel, and R. Tindell Connectivity extremal problems and the design of reliable probabilistic networks The Theory and Application of Graphs 1981 Wiley New York 89 98
    • (1981) The Theory and Application of Graphs , pp. 89-98
    • Bauer, D.1    Boesch, F.2    Suffel, C.3    Tindell, R.4
  • 7
    • 31244435524 scopus 로고    scopus 로고
    • Edge-cuts leaving components of order at least three
    • P. Bonsma, N. Ueffing, and L. Volkmann Edge-cuts leaving components of order at least three Discrete Math. 256 2002 431 439
    • (2002) Discrete Math. , vol.256 , pp. 431-439
    • Bonsma, P.1    Ueffing, N.2    Volkmann, L.3
  • 8
    • 0012419504 scopus 로고    scopus 로고
    • On the connectivity of the Cartesian product of two graphs
    • W.S. Chiue, and B.S. Shieh On the connectivity of the Cartesian product of two graphs Appl. Math. Comput. 102 1999 129 137
    • (1999) Appl. Math. Comput. , vol.102 , pp. 129-137
    • Chiue, W.S.1    Shieh, B.S.2
  • 9
    • 0024765312 scopus 로고
    • Generalized measures of fault tolerance with application to n-cube networks
    • A.H. Esfahanian Generalized measures of fault tolerance with application to n-cube networks IEEE Trans. Comput. 38 11 1989 1586 1591
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.11 , pp. 1586-1591
    • Esfahanian, A.H.1
  • 10
    • 0024281477 scopus 로고
    • On computing a conditional edge connectivity of a graph
    • DOI 10.1016/0020-0190(88)90025-7
    • A.H. Esfahanian, and S.L. Hakimi On computing a conditional edge connectivity of a graph Inform. Process. Lett. 27 1988 195 199 (Pubitemid 18606921)
    • (1988) Information Processing Letters , vol.27 , Issue.4 , pp. 195-199
    • Esfahanian, A.-H.1    Hakimi, S.L.2
  • 11
    • 0040223169 scopus 로고
    • Extraconnectivity of graphs with large girth
    • J. Fbrega, and M.A. Fiol Extraconnectivity of graphs with large girth Discrete Math. 127 1994 163 170
    • (1994) Discrete Math. , vol.127 , pp. 163-170
    • Fbrega, J.1    Fiol, M.A.2
  • 12
    • 17944395031 scopus 로고    scopus 로고
    • On the extraconnectivity of graphs
    • J. Fbrega, and M.A. Fiol On the extraconnectivity of graphs Discrete Math. 155 1996 49 57 (Pubitemid 126387712)
    • (1996) Discrete Mathematics , vol.155 , Issue.1-3 , pp. 49-57
    • Fabrega, J.1    Fiol, M.A.2
  • 13
    • 43249094445 scopus 로고    scopus 로고
    • Further topics in connectivity
    • J.L. Gross, J. Yellen, CRC Press London, New York
    • J. Fbrega, and M.A. Fiol Further topics in connectivity J.L. Gross, J. Yellen, Handbook of Graph Theory 2004 CRC Press London, New York 300 329
    • (2004) Handbook of Graph Theory , pp. 300-329
    • Fbrega, J.1    Fiol, M.A.2
  • 14
    • 15344341969 scopus 로고    scopus 로고
    • Cuts leaving components of given minimum order
    • DOI 10.1016/j.disc.2004.11.004, PII S0012365X05000075
    • A. Hellwig, D. Rautenbach, and L. Volkmann Cuts leaving components of given minimal order Discrete Math. 292 2005 55 65 (Pubitemid 40391539)
    • (2005) Discrete Mathematics , vol.292 , Issue.1-3 , pp. 55-65
    • Hellwig, A.1    Rautenbach, D.2    Volkmann, L.3
  • 15
    • 43249097822 scopus 로고    scopus 로고
    • Maximally edge-connected and vertex-connected graphs and digraphs: A survey
    • DOI 10.1016/j.disc.2007.06.035, PII S0012365X07004803
    • A. Hellwig, and L. Volkmann Maximally edge-connected and vertex-connected graphs and digraphs: a survey Discrete Math. 308 2008 3265 3296 (Pubitemid 351657518)
    • (2008) Discrete Mathematics , vol.308 , Issue.15 , pp. 3265-3296
    • Hellwig, A.1    Volkmann, L.2
  • 16
    • 0033095304 scopus 로고    scopus 로고
    • Super edge connectivity properties of connected edge symmetric graphs
    • Q.L. Li, and Q. Li Super-edge connectivity of connected edge transitive graphs Networks 33 1999 157 159 (Pubitemid 129318631)
    • (1999) Networks , vol.33 , Issue.2 , pp. 157-159
    • Li, Q.1    Li, Q.2
  • 17
    • 0002601802 scopus 로고
    • Minimale n-fach Kantenzusammenhngenden Graphen
    • M. Mader Minimale n-fach Kantenzusammenhngenden Graphen Math. Ann. 191 1971 21 28
    • (1971) Math. Ann. , vol.191 , pp. 21-28
    • Mader, M.1
  • 18
    • 0002183220 scopus 로고
    • Connectivity and edge-connectivity in finite graphs
    • B. Bollobs, London Math. Soc. Lecture Note Series Cambridge University Press Cambridge, New York
    • W. Mader Connectivity and edge-connectivity in finite graphs B. Bollobs, Surveys in Combinatorics, Proceedings of the Seventh British Combinatorial Conference, Cambridge, 1979 London Math. Soc. Lecture Note Series vol. 38 1979 Cambridge University Press Cambridge, New York 66 95
    • (1979) Surveys in Combinatorics, Proceedings of the Seventh British Combinatorial Conference, Cambridge, 1979 , vol.38 , pp. 66-95
    • Mader, W.1
  • 19
    • 0037421179 scopus 로고    scopus 로고
    • Optimally super-edge-connected transitive graphs
    • J.X. Meng Optimally super-edge-connected transitive graphs Discrete Math. 260 2003 239 248
    • (2003) Discrete Math. , vol.260 , pp. 239-248
    • Meng, J.X.1
  • 20
    • 84867947324 scopus 로고    scopus 로고
    • On a kind of restricted edge connectivity of graphs
    • J.X. Meng, and Y.H. Ji On a kind of restricted edge connectivity of graphs Discrete Appl. Math. 117 2002 183 193
    • (2002) Discrete Appl. Math. , vol.117 , pp. 183-193
    • Meng, J.X.1    Ji, Y.H.2
  • 21
    • 0041133574 scopus 로고    scopus 로고
    • Connectivity and Edge-connectivity in Graphs: A Survey
    • O.R. Oellermann Connectivity and edge-connectivity in graphs: a survey Congr. Numer. 116 1996 231 252 (Pubitemid 128121979)
    • (1996) Congr. Numer. , Issue.116 , pp. 231-252
    • Oellermann, O.R.1
  • 22
    • 28544453191 scopus 로고    scopus 로고
    • Edge cuts leaving components of order at least m
    • J.P. Ou 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
  • 24
    • 0141764680 scopus 로고    scopus 로고
    • Super edge- and point-connectivities of the Cartesian product of regular graphs
    • B.S. Shieh Super edge- and point-connectivities of the Cartesian product of regular graphs Networks 40 2002 91 96
    • (2002) Networks , vol.40 , pp. 91-96
    • Shieh, B.S.1
  • 25
    • 0039631182 scopus 로고    scopus 로고
    • Connectivity of Cayley graphs
    • D.Z. Du, D.F. Hsu, Kluwer Academic Publishers Dordrecht
    • R. Tindell Connectivity of Cayley graphs D.Z. Du, D.F. Hsu, Combinatorial Network Theory 1996 Kluwer Academic Publishers Dordrecht 41 64
    • (1996) Combinatorial Network Theory , pp. 41-64
    • Tindell, R.1
  • 26
    • 0037032968 scopus 로고    scopus 로고
    • Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
    • M. Wang, and Q. Li Conditional edge connectivity properties, reliability comparisons and transitivity of graphs Discrete Math. 258 2002 205 214
    • (2002) Discrete Math. , vol.258 , pp. 205-214
    • Wang, M.1    Li, Q.2
  • 27
    • 31244433586 scopus 로고    scopus 로고
    • On restricted edge-connectivity of graphs
    • J.M. Xu, and K.L. Xu 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
  • 29
    • 33644697321 scopus 로고    scopus 로고
    • Restricted edge connectivity of edge transitive graphs
    • Z. Zhang, and J. Meng Restricted edge connectivity of edge transitive graphs Ars Combin. 78 2006 297 308 (Pubitemid 43330319)
    • (2006) Ars Combinatoria , vol.78 , pp. 297-308
    • Zhang, Z.1    Meng, J.2
  • 30
    • 27944492031 scopus 로고    scopus 로고
    • A proof of an inequality concerning k-restricted edge connectivity
    • DOI 10.1016/j.disc.2005.04.020, PII S0012365X05003493
    • Z. Zhang, and J. Yuan A proof of an inequality concerning k-restricted edge connectivity Discrete Math. 304 2005 128 134 (Pubitemid 41668586)
    • (2005) Discrete Mathematics , vol.304 , Issue.1-3 , pp. 128-134
    • Zhang, Z.1    Yuan, J.2


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