Abstract
The generalized Fibonacci cube is the subgraph of the -cube induced on the set of all strings of length that do not contain as a substring. It is proved that if then . The key tool to prove this result is a result of Guibas and Odlyzko about the autocorrelation polynomial associated to a binary string. It is also proved that there exist pairs of strings such that , where and cannot be obtained from by its reversal or binary complementation. Strings and with for which are characterized.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.