Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875506 | Theoretical Computer Science | 2018 | 8 Pages |
Abstract
Qiao and Yang (2017) proved that all n-dimensional folded hypercubes are (2nâ2)-conditional edge-fault-tolerant strongly Menger edge connected for nâ¥5. Yang, Zhao and Zhang (2017) showed that all n-dimensional folded hypercubes are (2nâ3)-conditional fault-tolerant strongly Menger connected for nâ¥8. In this paper, we improve the result of Qiao and Yang by showing that all n-dimensional folded hypercubes are (3nâ5)-conditional edge-fault-tolerant strongly Menger edge connected for nâ¥5. Moreover, we present an example to show that our result is optimal with respect to the maximum tolerated edge faults. In addition, we show that the result of Yang, Zhao and Zhang is optimal by proving that the n-dimensional folded hypercubes are not (2nâ2)-conditional fault-tolerant strongly Menger connected for nâ¥8.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Qi Cheng, Pingshan Li, Min Xu,