Fault-free cycles in folded hypercubes with more faulty elements

Let FFv (respectively, FFe) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional folded hypercube FQ(n). In this paper, we show that FQ(n) - FFv - FFe contains a fault-free cycle with length at least 2(n) - 2 vertical bar FFv vertical bar if vertical bar FFe vertical bar + vertical bar FFv vertical bar <= 2n - 4 and vertical bar FFe vertical bar <= n - 1, where n >= 3. Our result improves the previously known result of [S.-Y. Hsieh, A note on cycle embedding in folded hypercubes with faulty elements, Information Processing Letters (2008), in press, doi:10.1016/j.ipl.2008.04.003] where vertical bar FFe vertical bar + vertical bar FFv vertical bar <= n - 1 and n >= 4. (c) 2008 Elsevier B.V. All rights reserved.