Article ID Journal Published Year Pages File Type
435331 Theoretical Computer Science 2016 5 Pages PDF
Abstract

Let FvFv and FeFe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube FQnFQn so that |Fv|+|Fe|≤n−2|Fv|+|Fe|≤n−2, for n≥2n≥2. Choose any fault-free edge e  . If n≥3n≥3 then there is a fault-free cycle of length l   in FQnFQn containing e, for every even l   ranging from 4 to 2n−2|Fv|2n−2|Fv|; if n≥2n≥2 is even then there is a fault-free cycle of length l   in FQnFQn containing e, for every odd l   ranging from n+1n+1 to 2n−2|Fv|−12n−2|Fv|−1.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,