A note on cycle embedding in folded hypercubes with faulty elements

A study was conducted to demonstrate cycle embedding in folded hypercubes with faulty elements. The study found that a n-dimensional hypercube can be represented as an undirected graph consists of 2n nodes labeled as binary numbers of length n. The study also found that the set of edges connects two nodes only if they differ in exactly one bit of their labels and a n-dimensional folded hypercube is a regular n-dimensional hypercube augmented by adding more links among its nodes. The study confirmed that n-dimensional folded hypercube can be obtained by adding a link between two nodes whose addresses are complementary to each other in an n-cube. The study concluded that n-dimensional folded hypercube is regular of the common degree n + 1 and faulty element is worst-case optimal.