메뉴 건너뛰기




Volumn 177, Issue 8, 2007, Pages 1782-1788

On reliability of the folded hypercubes

Author keywords

Connectivity; Edge connectivity; Extra connectivity; Folded hypercube

Indexed keywords

MATHEMATICAL MODELS; MEASUREMENT THEORY; PARALLEL PROCESSING SYSTEMS; TOPOLOGY;

EID: 33846619753     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2006.11.003     Document Type: Article
Times cited : (133)

References (28)
  • 1
    • 0016463503 scopus 로고
    • On the connectivity of clusters
    • Chen Z., and Fu K.S. On the connectivity of clusters. Inf. Sci. 8 4 (1975) 283-299
    • (1975) Inf. Sci. , vol.8 , Issue.4 , pp. 283-299
    • Chen, Z.1    Fu, K.S.2
  • 2
    • 33846566193 scopus 로고
    • Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs
    • Das S.R., and Sheng C.L. Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs. Inf. Sci. 14 3 (1978) 181-187
    • (1978) Inf. Sci. , vol.14 , Issue.3 , pp. 181-187
    • Das, S.R.1    Sheng, C.L.2
  • 3
    • 0029343189 scopus 로고
    • Algorithms and properties of a new two-level network with folded hypercubes as basic modules
    • Duh D.R., Chen G.H., and Fang J.F. Algorithms and properties of a new two-level network with folded hypercubes as basic modules. IEEE Trans. Parallel Distrib. Syst. 6 7 (1995) 714-723
    • (1995) IEEE Trans. Parallel Distrib. Syst. , vol.6 , Issue.7 , pp. 714-723
    • Duh, D.R.1    Chen, G.H.2    Fang, J.F.3
  • 5
    • 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 (1989) 1586-1591
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.11 , pp. 1586-1591
    • Esfahanian, A.H.1
  • 6
    • 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. 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
    • 0040223169 scopus 로고
    • Extraconnectivity of graphs with large girth
    • Fàbrega J., and Fiol M.A. 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
  • 8
    • 31044435457 scopus 로고    scopus 로고
    • Longest fault-free paths in hypercubes with vertex faults
    • Fu J.-S. Longest fault-free paths in hypercubes with vertex faults. Inf. Sci. 176 7 (2006) 759-771
    • (2006) Inf. Sci. , vol.176 , Issue.7 , pp. 759-771
    • Fu, J.-S.1
  • 9
    • 0020827886 scopus 로고
    • Conditional connectivity
    • Haray F. Conditional connectivity. Networks 13 (1983) 346-357
    • (1983) Networks , vol.13 , pp. 346-357
    • Haray, F.1
  • 11
    • 2442654399 scopus 로고    scopus 로고
    • Sufficient conditions for λ′-optimality in graphs of diameter 2
    • Hellwig A., and Volkmann L. Sufficient conditions for λ′-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
  • 12
    • 14644395517 scopus 로고    scopus 로고
    • Sufficient conditions for graphs to be λ′-optimal, super-edge-connected and maximally edge-connected
    • Hellwig A., and Volkmann L. Sufficient conditions for graphs to be λ′-optimal, super-edge-connected and maximally edge-connected. J. Graph Theory 48 (2005) 228-246
    • (2005) J. Graph Theory , vol.48 , pp. 228-246
    • Hellwig, A.1    Volkmann, L.2
  • 13
    • 9344232795 scopus 로고    scopus 로고
    • Forwarding indices of folded n-cubes
    • Hou X.-M., Xu M., and Xu J.-M. Forwarding indices of folded n-cubes. Discrete Appl. Math. 145 3 (2005) 490-492
    • (2005) Discrete Appl. Math. , vol.145 , Issue.3 , pp. 490-492
    • Hou, X.-M.1    Xu, M.2    Xu, J.-M.3
  • 14
    • 0036163478 scopus 로고    scopus 로고
    • Constructing one-to-many disjoint paths in folded hypercubes
    • Lai C.N., Chen G.H., and Duh D.R. Constructing one-to-many disjoint paths in folded hypercubes. IEEE Trans. Comput. 51 1 (2002) 33-45
    • (2002) IEEE Trans. Comput. , vol.51 , Issue.1 , pp. 33-45
    • Lai, C.N.1    Chen, G.H.2    Duh, D.R.3
  • 15
    • 2342531876 scopus 로고    scopus 로고
    • Generalized diameters and Rabin numbers of networks
    • Liaw S.C., and Chang G.J. Generalized diameters and Rabin numbers of networks. J. Combin. Optim. 2 (1998) 371-384
    • (1998) J. Combin. Optim. , vol.2 , pp. 371-384
    • Liaw, S.C.1    Chang, G.J.2
  • 16
    • 84867947324 scopus 로고    scopus 로고
    • On a kind of restricted connectivity of graphs
    • Meng J.-X., and Ji Y.-H. On a kind of restricted 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
  • 17
    • 27844602391 scopus 로고    scopus 로고
    • The vulnerability of the diameter of folded n-cubes
    • Simó E., and Yebra J.L.A. The vulnerability of the diameter of folded n-cubes. Discrete Math. 174 (1997) 317-322
    • (1997) Discrete Math. , vol.174 , pp. 317-322
    • Simó, E.1    Yebra, J.L.A.2
  • 18
    • 0038248737 scopus 로고    scopus 로고
    • Embedding Hamiltonian cycles into folded hypercubes with faulty links
    • Wang D. Embedding Hamiltonian cycles into folded hypercubes with faulty links. J. Parallel Distrib. Comput. 61 (2001) 545-564
    • (2001) J. Parallel Distrib. Comput. , vol.61 , pp. 545-564
    • Wang, D.1
  • 20
    • 15844427029 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Dordrecht/Boston/London
    • Xu J.-M. Theory and Application of Graphs (2003), Kluwer Academic Publishers, Dordrecht/Boston/London
    • (2003) Theory and Application of Graphs
    • Xu, J.-M.1
  • 21
    • 30844438528 scopus 로고    scopus 로고
    • On restricted arc-connectivity of regular digraphs
    • Xu J.-M., and Lü M. On restricted arc-connectivity of regular digraphs. Taiwan J. Math. 9 4 (2005) 661-670
    • (2005) Taiwan J. Math. , vol.9 , Issue.4 , pp. 661-670
    • Xu, J.-M.1    Lü, M.2
  • 22
    • 29144500423 scopus 로고    scopus 로고
    • Super connectivity of line graphs and digraphs
    • Xu J.-M., and Lü M. Super connectivity of line graphs and digraphs. Acta Math. Appli. Sinica 22 1 (2006) 43-48
    • (2006) Acta Math. Appli. Sinica , vol.22 , Issue.1 , pp. 43-48
    • Xu, J.-M.1    Lü, M.2
  • 24
    • 27844593273 scopus 로고    scopus 로고
    • Cycles in folded hypercubes
    • Xu J.-M., and Ma M.-J. Cycles in folded hypercubes. Appl. Math. Lett. 19 2 (2006) 140-145
    • (2006) Appl. Math. Lett. , vol.19 , Issue.2 , pp. 140-145
    • Xu, J.-M.1    Ma, M.-J.2
  • 25
    • 33846576022 scopus 로고    scopus 로고
    • Edge-fault-tolerant properties of hypercubes and folded hypercubes
    • Xu J.-M., Ma M.-J., and Du Z.-Z. Edge-fault-tolerant properties of hypercubes and folded hypercubes. Australasian J. Combinatorics 35 1 (2006) 7-16
    • (2006) Australasian J. Combinatorics , vol.35 , Issue.1 , pp. 7-16
    • Xu, J.-M.1    Ma, M.-J.2    Du, Z.-Z.3
  • 26
    • 31244433586 scopus 로고    scopus 로고
    • On restricted edge-connectivity of graphs
    • Xu J.-M., and Xu K.-L. On restricted edge-connectivity of graphs. Discrete Math. 243 1-3 (2002) 291-298
    • (2002) Discrete Math. , vol.243 , Issue.1-3 , pp. 291-298
    • Xu, J.-M.1    Xu, K.-L.2
  • 27
    • 27944455745 scopus 로고    scopus 로고
    • On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
    • Xu J.-M., Zhu Q., Hou X.-M., and Zhou T. On restricted connectivity and extra connectivity of hypercubes and folded hypercubes. J. Shanghai Jiaotong Univ. (Sci.) E-10 2 (2005) 208-212
    • (2005) J. Shanghai Jiaotong Univ. (Sci.) , vol.E-10 , Issue.2 , pp. 208-212
    • Xu, J.-M.1    Zhu, Q.2    Hou, X.-M.3    Zhou, T.4
  • 28
    • 31144432314 scopus 로고    scopus 로고
    • Edge fault tolerance analysis of a class of networks
    • Zhu Q., Xu J.-M., and Lü M. Edge fault tolerance analysis of a class of networks. Appl. Math. Comput. 172 1 (2006) 111-121
    • (2006) Appl. Math. Comput. , vol.172 , Issue.1 , pp. 111-121
    • Zhu, Q.1    Xu, J.-M.2    Lü, M.3


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