2015/01/02 by Jianxin Wei, Heping Zhang, Wei, Jianxin +1
Computer Science · Mathematics · #Algorithms and Data Compression #Combinatorics (math.CO) #Embedded Systems Design Techniques #FOS: Mathematics #Interconnection Networks and Systems #math.CO
paper · pdf · doi:10.48550/arxiv.1501.00377
arxiv created 2015/01/02 · openalex publication_date 2015/01/02 · arxiv updated 2015/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Generalized Fibonacci cube Qd(f), introduced by Ilić, Klavžar 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ć, Klavž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.