• DocumentCode
    3366009
  • Title

    Hamiltonian laceability of hypercubes with some faulty elements

  • Author

    Sun, Chao-Ming ; Jou, Yue-Dar

  • Author_Institution
    Dept. of Manage. Sci., R.O.C. Mil. Acad., Kaohsiung
  • fYear
    2009
  • fDate
    26-29 March 2009
  • Firstpage
    626
  • Lastpage
    630
  • Abstract
    An n-dimensional hypercube Qn is well known as bipartite and one of the most efficient networks for parallel computation. Fault tolerance is an important issue for a network since the vertex (or edge) in the network may fail sometimes. Assume that n ges 4 and P is a faulty path (or cycle) of order les 2n - 4 in Qn. We prove that Qn - P is Hamiltonian laceable. Furthermore, the bound is tight.
  • Keywords
    hypercube networks; parallel processing; Hamiltonian laceability; bipartite; faulty elements; hypercubes; parallel computation; Bipartite graph; Chaotic communication; Computational modeling; Computer networks; Concurrent computing; Distributed computing; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Parallel processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking, Sensing and Control, 2009. ICNSC '09. International Conference on
  • Conference_Location
    Okayama
  • Print_ISBN
    978-1-4244-3491-6
  • Electronic_ISBN
    978-1-4244-3492-3
  • Type

    conf

  • DOI
    10.1109/ICNSC.2009.4919350
  • Filename
    4919350
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3366009