共 50 条
A note on cycle embedding in hypercubes with faulty vertices
被引:14
|作者:
Du, Zheng-Zhong
[1
]
Xu, Jun-Ming
[1
]
机构:
[1] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhui, Peoples R China
关键词:
Combinatorics;
Cycle;
Graph;
Hypercube;
Fault tolerance;
HAMILTONIAN-LACEABILITY;
PATH;
BIPANCONNECTIVITY;
BIPANCYCLICITY;
RING;
NODES;
D O I:
10.1016/j.ipl.2011.03.002
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
Let f(v) denote the number of faulty vertices in an n-dimensional hypercube. This note shows that a fault-free cycle of length of at least 2(n) - 2f(v) can be embedded in an n-dimensional hypercube with f(v) = 2n - 3 and n >= 5. This result not only enhances the previously best known result, and also answers a question in [J.-S. Fu, Fault-tolerant cycle embedding in the hypercube, Parallel Computing 29 (2003) 821-832]. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:557 / 560
页数:4
相关论文