Fault-Tolerant Hamiltonicity of the WK-Recursive Networks

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2009

期刊名稱

2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009)

卷期與頁次

頁 592–+

ISBN

978-1-4244-5403-7

語言

英文

摘要

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. The fault-tolerant hamiltonian connectivity 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 the fault-tolerant hamiltonian connectivity of K(d,t) is d-4.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Ho, T.-Y., Lin, C.-K., Tan, J. J. M., & Hsu, L.-H. (2009). Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. 2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 592–+. https://doi.org/10.1109/I-SPAN.2009.116

BibTeX RIS

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

分享

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