ASIA unversity:Item 310904400/79840
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105671 (86%)
Visitors : 15363046      Online Users : 303
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item:

    Title: On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
    Authors: 龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang;林政寬;Lin, Cheng-Kuan;徐力行;Hsu, Lih-Hsing
    Contributors: 資訊工程學系
    Date: 2014-02
    Issue Date: 2014-06-05 12:17:26 (UTC+8)
    Abstract: Hsieh and Yu (2007) first claimed that an injured n-dimensional hypercube Q n contains (n−1−f)-mutually independent fault-free Hamiltonian cycles, where f≤n−2 denotes the total number of permanent edge-faults in Q n for n≥4, and edge-faults can occur everywhere at random. Later, Kueng et al. (2009a) presented a formal proof to validate Hsieh and Yu’s argument. This paper aims to improve this mentioned result by showing that up to (n−f)-mutually independent fault-free Hamiltonian cycles can be embedded under the same condition. Let F denote the set of f faulty edges. If all faulty edges happen to be incident with an identical vertex s, i.e., the minimum degree of the survival graph Q n −F is equal to n−f, then Q n −F contains at most (n−f)-mutually independent Hamiltonian cycles starting from s. From such a point of view, the presented result is optimal. Thus, not only does our improvement increase the number of mutually independent fault-free Hamiltonian cycles by one, but also the optimality can be achieved
    Appears in Collections:[Department of Computer Science and Information Engineering] Journal Artical

    Files in This Item:

    There are no files associated with this item.

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback