Fault-Tolerant Cycles Embedding in Folded Hypercubes  

作　　者：LIU Hongmei TANG Maozeng 

机构地区：[1]College of Science, China Three Gorges University

出　　处：《Wuhan University Journal of Natural Sciences》2016年第3期191-198,共8页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China(11071022);the Key Project of Hubei Department of Education(D20092207)

摘　　要：The generalized conditional fault-tolerant embedding is investigated, in which the n-dimensional folded hypercube networks （denoted by FQn） acts as the host graph, and the longest fault-free cycle represents the guest graph. Under the conditions looser than that of previous works, it is shown that FQn has a cycle with length at least 2n -21F, I when the number of faulty vertices and non-critical edges is at most 2n-4; where ｜Fv｜ is the number of faulty vertices. It provides further theoretical evidence for the fact that FQn has excellent node-fault-tolerance and edge-fault-tolerance when used as a topology of large scale computer networks.The generalized conditional fault-tolerant embedding is investigated, in which the n-dimensional folded hypercube networks （denoted by FQn） acts as the host graph, and the longest fault-free cycle represents the guest graph. Under the conditions looser than that of previous works, it is shown that FQn has a cycle with length at least 2n -21F, I when the number of faulty vertices and non-critical edges is at most 2n-4; where ｜Fv｜ is the number of faulty vertices. It provides further theoretical evidence for the fact that FQn has excellent node-fault-tolerance and edge-fault-tolerance when used as a topology of large scale computer networks.

关 键 词：fault tolerance cycle embedding folded hypercube networks 

分 类 号：O212.1[理学—概率论与数理统计]