Fault-tolerant hamiltonian connectivity of the WK-recursive networks

檔案

日期

2014-07-01

類型

期刊名稱

INFORMATION SCIENCES

卷期與頁次

第 271 卷,頁 236–245

ISSN

0020-0255

語言

英文

摘要

Many research on the WK-recursive network has been published during the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity of the WK-recursive network. We use K(d, t) to denote the WK-recursive network of level t, each of which basic modules is a d-vertex complete graph, where d > 1 and t >= 1. The fault-tolerant hamiltonian connectivity H-f(k)(G) is defined to be the maximum integer k such that G is k fault-tolerant hamiltonian connected if G is hamiltonian connected and is undefined otherwise. In this paper, we prove that H-f(k)(K(d, t)) = d - 4 if d >= 4. (C) 2014 Elsevier Inc. All rights reserved.

所屬典藏

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

引用此條目

Ho, T.-Y., Lin, C.-K., Tan, J. J. M., & Hsu, L.-H. (2014). Fault-tolerant hamiltonian connectivity of the WK-recursive networks. INFORMATION SCIENCES, 271, 236–245. https://doi.org/10.1016/j.ins.2014.02.087

BibTeX RIS

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

分享

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