標題: Fault-tolerant hamiltonian connectivity of the WK-recursive networks
作者: Ho, Tung-Yang
Lin, Cheng-Kuan
Tan, Jimmy J. M.
Hsu, Lih-Hsing
資訊工程學系
Department of Computer Science
關鍵字: Hamiltonian;Hamiltonian connected;WK-recursive network
公開日期: 1-Jul-2014
摘要: 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.
URI: http://dx.doi.org/10.1016/j.ins.2014.02.087
http://hdl.handle.net/11536/24394
ISSN: 0020-0255
DOI: 10.1016/j.ins.2014.02.087
期刊: INFORMATION SCIENCES
Volume: 271
Issue: 
起始頁: 236
結束頁: 245
Appears in Collections:Articles


Files in This Item:

  1. 000336011900016.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.