Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

Information Processing Letters

Volumn 110, Issue 24, 2010, Pages 1088-1092

  Chen, Xie Bin ^a  

^a Zhangzhou Teachers College   (China)

Author keywords

Bipanconnectivity; Fault tolerance; Fault tolerant diameter; Hypercube; Interconnection networks; Path embedding

Indexed keywords

BIPANCONNECTIVITY; FAULT-TOLERANT DIAMETER; HYPER-CUBES; HYPERCUBE; PATH EMBEDDING; UPPER BOUND;

GEOMETRY; HAMMING DISTANCE; INTERCONNECTION NETWORKS; NETWORK ARCHITECTURE; QUALITY ASSURANCE;

FAULT TOLERANCE;

EID: 77957313548     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.09.012     Document Type: Article

References (23)

1. J.A. Bondy, and U.S.R. Murty Graph Theory with Applications 1976 Macmillan Press London
2. R. Caha, and V. Koubek Spanning multi-paths in hypercubes Discrete Math. 307 2007 2053 2066
3. X.-B. Chen Cycles passing through prescribed edges in a hypercube with some faulty edges Inform. Process. Lett. 104 2007 211 215
4. X.-B. Chen Hamiltonian paths and cycles passing through a prescribed path in hypercubes Inform. Process. Lett. 110 2009 77 82
5. X.-B. Chen Many-to-many disjoint paths in faulty hypercubes Inform. Sci. 179 2009 3110 3115
6. X.-B. Chen Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs Inform. Process. Lett. 110 2010 203 205
7. T. Dvoriák, and P. Gregor Partitions of faulty hypercubes into paths with prescribed endvertices SIAM J. Discrete Math. 22 2008 1448 1461
8. T. Dvoriák, and V. Koubek Long paths in hypercubes with a quadratic number of faults Inform. Sci. 179 2009 3736 3771
9. J. Fink, and P. Gregor Long paths and cycles in hypercubes with faulty vertices Inform. Sci. 179 2009 3634 3644
10. J.-S. Fu Longest fault-free paths in hypercubes with vertex faults Inform. Sci. 176 2006 759 771
11. P. Gregor, and T. Dvoriák Path partitions of hypercubes Inform. Process. Lett. 108 2008 402 406
12. F. Harary, J.P. Hayes, and H.-J. Wu A survey of the theory of hypercube graphs Comput. Math. Appl. 15 1988 277 289
13. S.-Y. Hsieh, and T.-H. Shen Edge-bipancyclicity of a hypercube with faulty vertices and edges Discrete Appl. Math. 156 2008 1802 1808
14. L.-H. Hsu, S.-C. Liu, and Y.-N. Yeh Hamiltonicity of hypercubes with a constraint of required and faulty edges J. Comb. Optim. 14 2007 197 204
15. T.-L. Kueng, T. Liang, L.-H. Hsu, and J.J.M. Tan Long paths in hypercubes with conditional node-faults Inform. Sci. 179 2009 667 681
16. F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes 1992 Morgan Kaufmann Publishers San Mateo, CA
17. M. Ma, G. Liu, and X. Pan Path embedding in faulty hypercubes Appl. Math. Comput. 192 2007 233 238
18. Y. Saad, and M.H. Schultz Topological properties of hypercubes IEEE Trans. Comput. 37 1988 867 872
19. C.-H. Tsai Fault-free cycles passing through prescribed paths in hypercubes with faulty edges Appl. Math. Lett. 22 2009 852 855
20. C.-H. Tsai Fault-tolerant cycles embedded in hypercubes with mixed link and node failures Appl. Math. Lett. 21 2008 855 860
21. W.-Q. Wang, and X.-B. Chen A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges Inform. Process. Lett. 107 2008 205 210
22. H.-L. Wang, J.-W. Wang, and J.-M. Xu Edge-fault-tolerant bipanconnectivity of hypercubes Inform. Sci. 179 2009 404 409
23. J.-M. Xu, and M. Ma Survey on path and cycle embedding in some networks Front. Math. China 4 2009 217 252