All good (bad) words consisting of 5 blocks
- First Online:
- 37 Downloads
Generalized Fibonacci cube Qd(f), introduced by Ilić, Klavžar and Rho, is the graph obtained from the hypercube Qd by removing all vertices that contain f as factor. A word f is good if Qd(f) is an isometric subgraph of Qd for all d ≥ 1, and bad otherwise. A non-extendable sequence of contiguous equal digits in a word μ is called a block of μ. Ilić, Klavžar 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.
KeywordsGeneralized Fibonacci cube isometric subgraph good word bad word
MR(2010) Subject Classification05C12 05C60
Unable to display preview. Download preview PDF.
- Hsu, W. J., Liu, J.: Distributed algorithms for shortest-path, deadlock-free routing and broadcasting in a class of interconnection topologies. Parallel Processing Symposium, 1992, 589–596Google Scholar
- Imrich, W., Klavžzar, S.: Product Graphs: Structure and Recognition, Wiley, New York, 2000Google Scholar