Matchings extend to Hamiltonian cycles in hyper cubes with faulty edges  

作　　者：Xie-Bin CHEN 

机构地区：[1]College of Mathematics and Statistics,Minnan Normal University,Zhangzhou 363000,China

出　　处：《Frontiers of Mathematics in China》2019年第6期1117-1132,共16页中国高等学校学术文摘·数学（英文）

基　　金：The work was supported by the National Natural Science Foundation of China(Grant No.11401290).

摘　　要：We consider the problem of existence of a Hamiltonian cycle containing a matching and avoiding some edges in an n-cubc Qn,and obtain the following results.Let n≥3,MСE(Qn),and FСE(Qn)\M with 1≤|F|≤2n-4-|M|.If M is a matching and every vertex is incident with at least two edges in the graph Qn-F,then all edges of M lie on a Hamiltonian cycle in Qn-F.Moreover,if|M|=1 or|M|==2,then the upper bound of number of faulty edges tolerated is sharp.Our results generalize the well-known result for |M|=1.

关 键 词：HYPERCUBE Hamiltonian cycle fault tolerance matching interconnection network 

分 类 号：O15[理学—数学]