Author： Lin Cheng-Kuan
Publisher： Taylor & Francis Ltd
ISSN： 0020-7160
Source： International Journal of Computer Mathematics, Vol.86, Iss.1, 2009-01, pp. : 57-66
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Some research on the folded Petersen cube networks have been published for the past several years due to its favourite properties. In this paper, we consider the fault-tolerant hamiltonicity and the fault-tolerant hamiltonian connectivity of the folded Petersen cube networks. We use FPQn, k to denote the folded Petersen cube networks of parameters n and k. In this paper, we show that FPQn, k-F remains hamiltonian for any F ⊆ V(FPQn, k)∪E(FPQn, k) with |F|≤n+3k-2 and FPQn, k-F remains hamiltonian connected for any F ⊆ V(FPQn, k)∪E(FPQn, k) with |F|≤n+3k-3 if (n, k)∉{(0, 1)}∪{(n, 0) | n is a positive integer}. Moreover, this result is optimal.
Related content
Fault-Tolerant Broadcasting in Radio Networks
By Kranakis E. Krizanc D. Pelc A.
Journal of Algorithms, Vol. 39, Iss. 1, 2001-04 ,pp. :
Access to resources
Recommend
Proactive fault‐tolerant model predictive control
AICHE JOURNAL, Vol. 1-1541, Iss. 8, 2013-08 ,pp. :