摘要
证明了在至多具有2n-3条故障边的n维(n≥3)折叠超立方体网络中,如果每个顶点至少与两条非故障边相邻,则存在一个不含故障边的哈密顿圈.这个界是最好的.
For any n-dimensional （n≥3） folded hypercube with at most 2n-3 faulty edges in which each vertex is incident with at least two fault-free edges, it is proved that there exists a fault-free Hamiltonian cycle. The result is optimal.
基金
Supported by NNSF of China(10271114).
关键词
超立方体
折叠超立方体
容错
哈密顿圈
hypercube
folded hypercube
fault-tolerance
Hamiltonian cycle
