English

The index of a string consisting of 4 blocks

Combinatorics 2015-01-05 v1

Abstract

Generalized Fibonacci cube Qd(f)Q_{d}(f), introduced by Ili\'{c}, Klav\v{z}ar and Rho, is the graph obtained from the dd-hypercube QdQ_{d} by removing all vertices that contain ff as a substring. The smallest integer dd such that Qd(f)Q_{d}(f) is not an isometric subgraph of QdQ_{d} is called the index of ff. A non-extendable sequence of contiguous equal digits in a string μ\mu is called a block of μ\mu. The question that determine the index of a string consisting of at most 3 blocks is solved by Ili\'{c}, Klav\v{z}ar and Rho. This question is further studied and the index of a string consisting of 4 blocks is determined, and the necessity of a string being good is also given for the strings with even blocks.

Keywords

Cite

@article{arxiv.1501.00377,
  title  = {The index of a string consisting of 4 blocks},
  author = {Jianxin Wei and Heping Zhang},
  journal= {arXiv preprint arXiv:1501.00377},
  year   = {2015}
}