Abstract
In this paper, we focus on the vertex-fault-tolerant cycles embedding on enhanced hypercube, which is an attractive variant of hypercube and is obtained by adding some complementary edges from hypercube. Let F v be the set of faulty vertices in the n-dimensional enhanced hypercube Q n,k (1 ≤ k ≤ n−1). When |F v | = 2, we showed that Q n,k − F v contains a fault-free cycle of every even length from 4 to 2n −4 where n (n ≥ 3) and k have the same parity; and contains a fault-free cycle of every even length from 4 to 2n − 4, simultaneously, contains a cycle of every odd length from n − k + 2 to 2n − 3 where n(≥ 3) and k have the different parity. Furthermore, when |F v| = f v ≤ n − 2, we proof that there exists the longest fault-free cycle, which is of even length 2n − 2f v whether n(n ≥ 3) and k have the same parity or not; and there exists the longest fault-free cycle, which is of odd length 2n − 2f v − 1 in Q n,k − F v where n(≥ 3) and k have the different parity.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R. Graph theory with application networks. Kluwer Academic Publishers, London, 1976
Tzeng, N.F., Wei, S. Enhanced hypercube. IEEE Transactions on Computer 3: 284–294 (1991)
Liu, H.M. The structural features of enhanced hypercube networks. The 5th International Conference on Natural Computation, 2009, 345–348
Liu, H.M. Properties and performance of enhanced hypercube networks. Journal of systems science and information. 3: 251–256 (2006)
Liu, H.M. The construction of disjoint paths in folded hypercube. Journal of Systems Science and Information, 8: 97–102 (2010)
Tsai, C.H. Fault-tolerant cycles embedded in hypercubes with mixed link and node failures. Applied Mathematics Letters, 21: 855–860 (2008)
Li, T.K., Tsai, C.H., Jimmy, J.M.Tan, Hsu, L.H. Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. Inform. Process. Lett. 87: 107–110 (2003)
Tsai, C.H., Tan, J.M., Liang, T., Hsu, L.H. Fault-tolerant hamiltonian laceability of hypercubes. Inform. Procsee. Lett., 83: 301–306 (2002)
Tsai, C.H. Cycles embedding in hypercubes with node failures. Inform. Procsee. Lett., 102: 242–246 (2007)
Latifi, S., Zheng, S.Q., Bagherzadeh, N. Optimal ring embedding in hypercubes with faulty links. Proceedings of the 22 Annual International Symposium on Fault-Tolerant Computing, Boston, MA, 1992, 178–184
Saad, Y., Schultz, M.H. Topological of hypercubes. IEEE Trans. Comput., 37(7): 867–872 (1988)
Leighton, F.T. Introduction to Parallel Algorithms and architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992
Xu, J.M., Du, Z.Z., Xu, M. Edge-fault-tolerant edge-bipancyclicity of hypercubes. Inform. Process. Lett., 96(4): 146–150 (2005)
Fu, J.S. Fault-tolerant cycles embedding in the hypercube. Parallel Comput., 29: 821–832 (2003)
Hsieh, S.Y. Fault-tolerant cycles embedding in the hypercube with both faulty vertices and faulty edges. Parallel Comput., 32: 84–91 (2006)
Hsieh, S.Y., Kuo, C.N., Huang, H.L. 1-vertex-fault-tolerant cycles embedding on folded hypercubes. Discrete Applied Mathematics, 157: 3094–3098 (2009)
Wang, D. Embedding hamiltonian cycles into folded hypercubes with faulty links. Parallel Distr. Comput., 61: 545–564 (2001)
Choudum, S.A., Usha nandini R. Complete binary trees in folded and enhanced cube. Networks, 43: 226–272 (2004)
Liu, Min. Cycles in conditional faulty enhanced hypercube networks. Journal of Communications and Networks, 2(2): 213–221 (2012)
Hsieh, S.Y. Some edge-fault-tolerant properties of folded hypercube. Networks, 51(2): 92–101 (2008)
Hsieh, S.Y., Yu, Peiyu. Fault-free mutually independent hamiltonian cycles in hypercubes with faulty edges. Journal of Combinatorial Optimization., 13(2): 153–162 (2007)
Hsieh, S.Y., Lee, C.W. Pancyclicity of restricited hypercube-like networks under the conditional fault model. SIAM Journal on Discrete Mathematics., 23(4): 2010–2019 (2010)
Hsieh, S.Y., Lee, S.H. Conditional edge-fault hamiltonicity of maching composition networks. IEEE Transactions on Parallel and Distributed Systems, 20(4): 581–592 (2009)
Hsieh, S.Y., Chang, N.W. Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges. IEEE Transactions on Computers, 55(7): 854–863 (2006)
Hsieh, S.Y., Ho, C.W., Chen, G.H. Faulty-free hamiltonian cycles in faulty arrangement graphs. IEEE Transactions on Parallel and Distributed Systems, 10(3): 223–237 (1999)
Hsieh, S.Y., Guo, Z.N. Hamiltonian-connectivity and strongly hamiltonian-laceability of folded hypercubes. Computers and Mathematics with Applications, 53(7): 1040–1044 (2007)
Ma, M., Liu, G., Pan, X. Paths embedding in faulty hyperubes. Applied Mathematics and Computation, 192: 233–238 (2007)
Liu, Min, Liu, Hongmei. Paths and Cycles Embedding on Faulty Enhanced Hypercube Networks. Acta Mathematica Scientia, 33(6): 1579–1588 (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by the National Natural Science Foundation of China under Grant No. 11371162 and 11171129, National Natural Science Foundation of Hubei Province No. T201103.
Rights and permissions
About this article
Cite this article
Liu, M., Liu, Hm. Vertex-fault-tolerant cycles embedding on enhanced hypercube networks. Acta Math. Appl. Sin. Engl. Ser. 32, 187–198 (2016). https://doi.org/10.1007/s10255-016-0547-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-016-0547-z