On Isomorphism Classes of Generalized Fibonacci Cubes
Combinatorics
2014-02-27 v1
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.
Cite
@article{arxiv.1402.6377,
title = {On Isomorphism Classes of Generalized Fibonacci Cubes},
author = {Jernej Azarija and Sandi Klavžar and Jaehun Lee and Jay Pantone and Yoomi Rho},
journal= {arXiv preprint arXiv:1402.6377},
year = {2014}
}