Long paths in hypercubes with conditional node-faults

檔案

日期

2009-02-15

期刊名稱

INFORMATION SCIENCES

摘要

Let F be a set of f <= 2n - 5 faulty nodes in an n-cube Q(n) such that every node of Q(n) still has at least two fault-free neighbors. Then we show that Q(n) - F contains a path of length at least 2(n) - 2f - 1 (respectively, 2(n) - 2f - 2) between any two nodes of odd (respectively, even) distance. Since the n-cube is bipartite, the path of length 2(n) - 2f - 1 (or 2(n) - 2f - 2) turns out to be the longest if all faulty nodes belong to the same partite set. As a contribution, our study improves upon the previous result presented by [J.-S. Fu, Longest fault-free paths in hypercubes with vertex faults, Information Sciences 176 (2006) 759-771] where only n - 2 faulty nodes are considered. (c) 2008 Elsevier Inc. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Kueng, T.-L., Liang, T., Hsu, L.-H., & Tan, J. J. M. (2009). Long paths in hypercubes with conditional node-faults. INFORMATION SCIENCES, 179(5), 667–681. https://doi.org/10.1016/j.ins.2008.10.015

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/7628