The index of a string consisting of 4 blocks

Abstract

Generalized Fibonacci cube Qd(f), introduced by Ili\'c, Klavzar and Rho, is the graph obtained from the d-hypercube Qd by removing all vertices that contain f as a substring. The smallest integer d such that Qd(f) is not an isometric subgraph of Qd is called the index of f. A non-extendable sequence of contiguous equal digits in a string μ is called a block of μ. The question that determine the index of a string consisting of at most 3 blocks is solved by Ili\'c, Klavzar 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…