Edge-Bipancyclicity of All Conditionally Faulty Hypercubes

  • Chao-Ming Sun
  • Yue-Dar Jou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6082)

Abstract

In this paper, we consider the conditionally faulty hypercube Q n with n ≥ 2 that each vertices of Q n is incident with at least m fault-free edges, 2 ≤ m ≤ n − 1. We shall generalize the limitation m ≥ 2 in all previous results of edge-bipancyclicity. For every integer m, under the hypothesis, we prove that Q n is (n − 2)-edge-fault-tolerant edge-bipancyclic, and the results are optimal with respect to the number of edge faults tolerated. This improves some known results on edge-bipancyclicity of hypercubes.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amar, D., Fournier, I., Germa, A.: Pancyclism in Chvátal-Erdös graph. Graphs Combinat. 7, 101–112 (2004)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Alspach, B., Hare, D.: Edge-pancyclic block-intersection graphs. Discrete Math. 97(1-3), 17–24 (1991)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bondy, J.-A.: U.S.R. Murty, Graph Theory with Applications. North Holland, New York (1980)Google Scholar
  4. 4.
    Bondy, J.-A.: Pancyclic graphs I. J. Combinat. Theory 11, 80–84 (1971)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Chan, M.-Y., Lee, S.-J.: On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J. Discrete Math. 4, 511–527 (1991)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Day, K., Tripathik, A.: Embedding of cycles in arrangement graphs. IEEE Trans. Comput. 12, 1002–1006 (1993)CrossRefGoogle Scholar
  7. 7.
    Fu, J.-S.: Fault-tolerant cycle embedding in the hypercube. Parallel Comput. 29, 821–832 (2003)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Harary, F.: Conditional connectivity. Networks 13, 347–357 (1983)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Harary, F., Hayes, J.-P., Wu, H.-J.: A survey of the theory of hypercube graphs. Math. Appl. 15, 277–289 (1988)MATHMathSciNetGoogle Scholar
  10. 10.
    Hobbs, A.: The square of a block is vertex pancyclic. J. Combinat. Theory B 20, 1–4 (1976)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Latifi, S., Hegde, M., Naraghi-pour, M.: Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43, 218–222 (1994)CrossRefGoogle Scholar
  12. 12.
    Leighton, F.-T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)MATHGoogle Scholar
  13. 13.
    Li, T.-K., Tsai, C.-H., Tan, J.J.M., Hsu, L.-H.: Bipanconnected and edge-fault-tolerant bipancyclic of hypercubes. Inform. Proc. Lett. 87, 107–110 (2003)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Mitchem, J., Schmeichel, E.: Pancyclic and bipancyclic graphs-a survey. Graphs and Applications, 271–278 (1982)Google Scholar
  15. 15.
    Saad, Y., Schultz, M.-H.: Topological properties of hypercube. IEEE Trans. Comput. 37, 867–872 (1988)CrossRefGoogle Scholar
  16. 16.
    Simmons, G.: Almost all n-dimensional rectangular lattices are Hamilton laceable. Congr. Numer. 21, 649–661 (1978)Google Scholar
  17. 17.
    Shih, L.-M., Tan, J.J.M., Liang, T., Hsu, L.-H.: Edge-bipancyclicity of conditional faulty hypercubes. Inform. Proc. Lett. 105, 20–25 (2007)CrossRefGoogle Scholar
  18. 18.
    Sun, C.-M., Hung, C.-N., Hunang, H.-M., Hsu, L.-H., Jou, Y.-D.: Hamiltonian laceability of faulty hypercubes. J. Interconnection Networks 8(2), 133–145 (2007)CrossRefGoogle Scholar
  19. 19.
    Tsai, C.-H.: Linear array and ring embeddings in conditional faulty hypercubes. Theoretical Computer Science 314, 431–443 (2004)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Chao-Ming Sun
    • 1
  • Yue-Dar Jou
    • 1
  1. 1.Department of Electrical Engineering R.O.C. Military AcademyKaohsiungTaiwan

Personalised recommendations