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.
|Title of host publication||10th International Symposium on Pervasive Systems, Algorithms, and Networks|
|Number of pages||3|
|State||Published - 2009|
- hamiltonian; hamiltonian connected; fault-tolerant hamiltonian; WK-recursive network
- ARRANGEMENT GRAPHS; CUBES; CONNECTIVITY