Fault-Tolerant Hamiltonicity of the WK-Recursive Networks
Tung-Yang Ho, Cheng‐Kuan Lin, Jimmy J.M. Tan, Lih‐Hsing Hsu · 2009
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.