• DocumentCode
    1704179
  • Title

    Vertex-Fault-Tolerant Cycles Embedding on Enhanced Hypercube

  • Author

    Yingying, Liu ; Hongmei, Liu ; Yanjuan, Zhang

  • Author_Institution
    Coll. of Sci., China Three Gorges Univ., Yichang, China
  • fYear
    2010
  • Firstpage
    460
  • Lastpage
    462
  • Abstract
    Recently, many variants of hypercube have been investigated. In this article, we mainly focus our attention on a more hypercube-like network, the enhanced hypercube. The n-dimensional enhanced hypercube, denoted by Qn,k, possesses many properties superior to the hypercube. Many properties of enhanced hypercube have been proposed, however, this paper aims to show that when the network has a faulty vertex, a cycle can embed in it. Let / be a faulty vertex in n-dimensional enhanced hypercube Qn,k, if n and k have the same parity, then Qn,k - {f} contains a faulty-free cycle of every even length from 4 to 2n - 2, and if n and k have different parity, then Qn,k - {f} contains a faulty-free cycle of every even length from 4 to 2n-2 and every odd length from n-k + 2 to 2n - 1.
  • Keywords
    fault tolerant computing; graph theory; hypercube networks; network theory (graphs); enhanced hypercube; faulty-free cycle; hypercube-like network; vertex-fault-tolerant cycles; Bipartite graph; Educational institutions; Electronic mail; Fault tolerance; Fault tolerant systems; Hypercubes; Parallel processing; Cycle; Enhanced hypercube; Fault-tolerant; Faulty-free;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multimedia Information Networking and Security (MINES), 2010 International Conference on
  • Conference_Location
    Nanjing, Jiangsu
  • Print_ISBN
    978-1-4244-8626-7
  • Electronic_ISBN
    978-0-7695-4258-4
  • Type

    conf

  • DOI
    10.1109/MINES.2010.103
  • Filename
    5671051