Abstract
Problems about embedding of disjoint paths in interconnection networks have received much attention in recent years. A connected graph G is strong Menger connected if there are \(\min \{d_G(u), d_G(v)\}\) internally disjoint paths joining any two distinct vertices u and v in G. The enhanced hypercube \(Q_{n,k}\) is an important variant of the hypercube \(Q_n\) that retains many desirable properties of the hypercube. In order to study its fault tolerance, we consider the problem of embedding internally disjoint paths in an enhanced hypercube when part of the network is faulty. We show that the subgraph obtained from the enhanced hypercube \(Q_{n,k}\) \((2\le k\le n)\) by deleting the vertices of a faulty subnetwork \(Q_s\) \((1\le s\le n-1)\) or \(Q_{s,k}\) \((k\le s\le n-1)\) is strong Menger connected.
Similar content being viewed by others
References
Benini, L., Micheli, G.D.: Networks on chips: a new SoC paradigm. Computer 35(1), 70–78 (2002)
Chen, Y.C., Chen, M.H., Tan, J.J.M.: Maximally local connectivity and connected components of augmented cubes. Inf. Sci. 273, 387–392 (2014)
Cheng, Q., Li, P., Xu, M.: Conditional (edge-) fault-tolerant strong Menger (edge) connectivity of folded hypercubes. Theoret. Comput. Sci. 728, 1–8 (2018)
El-Amawy, A., Latifi, S.: Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Syst. 2(1), 31–42 (1991)
Ghasemi, M.: Some results about the reliability of folded hypercubes. Bull. Malays. Math. Sci. Soc. 44(2), 1093–1099 (2021)
Gu, M.M., Chang, J.M., Hao, R.X.: Strong Menger connectedness of augmented k-ary n-cubes. Comput. J. 64(5), 812–825 (2021)
Guo, J., Lu, M.: Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs. Discret. Appl. Math. 297, 109–119 (2021)
Guo, L., Qin, C., Xu, L.: Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes. J. Parallel Distrib. Comput. 138, 190–198 (2020)
Lai, C.N.: Optimal node-disjoint paths in folded hypercubes. J. Parallel Distrib. Comput. 147, 100–107 (2021)
Lee, C.W., Hsieh, S.Y., Yang, S.S.: \({\rm R}_{3}\)-connectivity of folded hypercubes. Discret. Appl. Math. 285, 261–273 (2020)
Lin, C.K., Zhang, L., Fan, J., Wang, D.: Structure connectivity and substructure connectivity of hypercubes. Theoret. Comput. Sci. 634, 97–107 (2016)
Ma, M., Yu, J.: Edge-disjoint paths in faulty augmented cubes. Discret. Appl. Math. 294, 108–114 (2021)
Ma, M., West, D., Xu, J.M.: The vulnerability of the diameter of the enhanced hypercubes. Theoret. Comput. Sci. 694, 60–65 (2017)
Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 96–115 (1927)
Oh, E., Chen, J.: On strong Menger-connectivity of star graphs. Discret. Appl. Math. 129, 499–511 (2003)
Qiao, Y., Yang, W.: Edge disjoint paths in hypercubes and folded hypercubes with conditional faults. Appl. Math. Comput. 294, 96–101 (2017)
Sabir, E., Mamut, A., Vumar, E.: The extra connectivity of the enhanced hypercubes. Theoret. Comput. Sci. 799, 22–31 (2019)
Tzeng, N.F., Wei, S.: Enhanced hypercubes. IEEE Trans. Comput. 40(3), 284–294 (1991)
Wang, D.: Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model. IEEE Trans. Comput. 48(12), 1369–1374 (1999)
Wang, Y., Lin, C.K., Zhou, S., Tian, T.: Subgraph-based strong Menger connectivity of hypercube and exchanged hypercube. Int. J. Found. Comput. Sci. 32(3), 305–330 (2021)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)
Xu, J.M.: Combinatorial Theory in Networks. Science Press, Beijing (2013)
Xu, M., Li, P.: Edge-fault-tolerant strong Menger edge connectivity on regular graphs. Theoret. Comput. Sci. 847, 39–48 (2020)
Xu, L., Zhou, S., Liu, J., Yin, S.: Reliability measure of multiprocessor system based on enhanced hypercubes. Discret. Appl. Math. 289, 125–138 (2021)
Zhao, S., Yang, W.: Conditional connectivity of folded hypercubes. Discret. Appl. Math. 257, 388–392 (2019)
Acknowledgements
The authors would like to thank the anonymous referees for their valuable suggestions. This work is partially supported by Shandong Provincial Natural Science Foundation (No. ZR2021MF012) and National Natural Science Foundation of China (No. 62076039).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict interest regarding the publication of this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ma, M., Guo, C. & Li, XJ. Disjoint paths in the enhanced hypercube with a faulty subgraph. J. Appl. Math. Comput. 69, 1343–1354 (2023). https://doi.org/10.1007/s12190-022-01794-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-022-01794-z