1-vertex-fault-tolerant cycles embedding on folded hypercubes
In this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f f be a faulty vertex in an n n -dimensional folded hypercube FQn F Q n . We show that FQn?{f} F Q n ? { f } contains a fault-free cycle of every even length from 4 to 2n?2 2 n ? 2 if n?3 n ? 3 and, furthermore, every odd length from n+1 n + 1 to 2n?1 2 n ? 1 if n?2 n ? 2 and n n is even.
folded hypercubes interconnection networks bipartite graphs fault-tolerant embedding