摘要

Generalized Fibonacci cube Q(d) (f), introduced by IliAc, Klavzar and Rho, is the graph obtained from the hypercube Q(d) by removing all vertices that contain f as factor. A word f is good if Q(d) (f) is an isometric subgraph of Q(d) for all d >= 1, and bad otherwise. A non-extendable sequence of contiguous equal digits in a word mu is called a block of mu. Ilic, Klavzar and Rho shown that all the words consisting of one block are good, and all the words consisting of three blocks are bad. So a natural problem is to study the words consisting of other odd number of blocks. In the present paper, a necessary condition for a word consisting of odd number of blocks being good is given, and all the good (bad) words consisting of 5 blocks is determined.