Skip to main content
Log in

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In the paper “Fault-free Mutually Independent Hamiltonian Cycles in Hypercubes with Faulty Edges” (J. Comb. Optim. 13:153–162, 2007), the authors claimed that an n-dimensional hypercube can be embedded with (n−1−f)-mutually independent Hamiltonian cycles when fn−2 faulty edges may occur accidentally. However, there are two mistakes in their proof. In this paper, we give examples to explain why the proof is deficient. Then we present a correct proof.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Akers SB, Krishnameurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38:555–566

    Article  MATH  MathSciNet  Google Scholar 

  • Bondy JA, Murty USR (1980) Graph theory with applications. North-Holland, New York

    Google Scholar 

  • Chang C-H, Lin C-K, Huang H-M, Hsu L-H (2004) The super laceability of hyper-cubes. Inf Process Lett 92:15–21

    Article  MathSciNet  Google Scholar 

  • Hsieh S-Y, Yu P-Y (2007) Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J Comb Optim 13:153–162

    Article  MATH  MathSciNet  Google Scholar 

  • Johnsson SL, Ho C-T (1989) Optimum broadcasting and personalized communication in hypercubes. IEEE Trans Comput 38:1249–1268

    Article  MathSciNet  Google Scholar 

  • Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Kaufmann, San Mateo

    MATH  Google Scholar 

  • Leu Y, Kuo S (1999) Distributed fault-tolerant ring embedding and reconfiguration in hypercubes. IEEE Trans Comput 48:81–88

    Article  MathSciNet  Google Scholar 

  • Lewinter M, Widulski W (1997) Hyper-Hamilton laceable and caterpillar-spannable product graphs. Comput Math Appl 34:99–104

    Article  MATH  MathSciNet  Google Scholar 

  • Simmons G (1978) Almost all n-dimensional rectangular lattices are Hamilton laceable. Congres Numer 21:103–108

    MathSciNet  Google Scholar 

  • Sun C-M, Lin C-K, Huang H-M, Hsu L-H (2006) Mutually independent Hamiltonian paths and cycles in hypercubes. J Interconnect Netw 7(2):235–255

    Article  Google Scholar 

  • Tsai C-H, Tan JJM, Linag T, Hsu L-H (2002) Fault-tolerant Hamiltonian laceability of hypercubes. Inf Process Lett 83:301–306

    Article  MATH  Google Scholar 

  • Yang P-J, Tien S-B, Raghavendra CS (1994) Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Trans Comput 43:608–613

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tyne Liang.

Additional information

This work was supported in part by the National Science Council of the Republic of China under Contract NSC 95-2221-E-233-002.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kueng, TL., Lin, CK., Liang, T. et al. A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J Comb Optim 17, 312–322 (2009). https://doi.org/10.1007/s10878-007-9113-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9113-1

Keywords