Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

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 FPQ n, k to deno...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics 2009-01, Vol.86 (1), p.57-66
Main Authors: Lin, Cheng-Kuan, Ho, Tung-Yang, Tan, Jimmy J.M., Hsu, Lih-Hsing
Format: Article
Language:English
Subjects:
Fault tolerance
folded Petersen cube networks
hamiltonian
hamiltonian connected
Mathematics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 FPQ n, k to denote the folded Petersen cube networks of parameters n and k. In this paper, we show that FPQ n, k −F remains hamiltonian for any F ⊆ V(FPQ n, k )∪E(FPQ n, k ) with |F|≤n+3k−2 and FPQ n, k −F remains hamiltonian connected for any F ⊆ V(FPQ n, k )∪E(FPQ n, k ) with |F|≤n+3k−3 if (n, k)∉{(0, 1)}∪{(n, 0) | n is a positive integer}. Moreover, this result is optimal.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160701684485