Generalized fibonacci cubes are mostly h
โ
Jenshiuh Liu; Wen-Jing Hsu; Moon Jung Chung
๐
Article
๐
1994
๐
John Wiley and Sons
๐
English
โ 619 KB
## Abstract The __Hamiltonian problem__ is to determine whether a graph contains a spanning (Hamiltonian) path or cycle. Here we study the Hamiltonian problem for the __generalized Fibonacci cubes__, which are a new family of graphs that have applications in interconnection topologies [J. Liuand W.