Recursive fault-tolerance of Fibonacci cube in hypercubes Original Research Article

Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1ʹs. If we remove from Fibonacci cube the vertices with 1 both in the first and the last position, we obtain Lucas cube. We consider the problem of determining the minimum number of vertices in n-dimensional hypercube whose removal leaves no subgraph isomorphic to m-dimensional Fibonacci cube. The exact values for small m are given and several recursive bounds are established using the symmetry property of Lucas cubes and the technique of labeling. The relation to the problem of subcube fault-tolerance in hypercube is also shown.