On the existence of cycles of every even length on generalized Fibonacci cubes

  • Norma Zagaglia Salvi
Keywords: Fibonacci numbers, Boolean cube, Hamiltonian cycle


A new topology for the interconnection of computing nodes in multiprocessors systems is the generalized Fibonacci cube.

It can be embedded as a subgraph in the Boolean cube and it is also a supergraph of other structures. We prove that every edge of such a graph, but few initial cases, belongs to cycles of every even length.