The infinite Fibonacci cube and its generalizations
- Resource Type
- Working Paper
- Authors
- Trinh, Hiep; Wilson, Trevor M.
- Source
- Subject
- Mathematics - Combinatorics
05C60
- Language
The Fibonacci cube $\Gamma_n$ is is the graph whose vertices are independent subsets of the path graph of length $n$, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klav\v{z}ar [1] suggested considering the infinite Fibonacci cube $\Gamma_\infty$ whose vertices are independent subsets of the one-way infinite path graph with the same adjacency condition. We show that every connected component of $\Gamma_\infty$ is asymmetric (has no nontrivial automorphism) and no two connected components of $\Gamma_\infty$ are isomorphic. This follows from our results on a further generalization $\Gamma_G$ where $G$ is a simple, locally finite hypergraph with no isolated vertices.
Comment: 5 pages