The infinite Fibonacci cube and its generalizations
Combinatorics
2023-12-11 v1
Abstract
The Fibonacci cube is is the graph whose vertices are independent subsets of the path graph of length , 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 whose vertices are independent subsets of the one-way infinite path graph with the same adjacency condition. We show that every connected component of is asymmetric (has no nontrivial automorphism) and no two connected components of are isomorphic. This follows from our results on a further generalization where is a simple, locally finite hypergraph with no isolated vertices.
Cite
@article{arxiv.2312.05242,
title = {The infinite Fibonacci cube and its generalizations},
author = {Hiep Trinh and Trevor M. Wilson},
journal= {arXiv preprint arXiv:2312.05242},
year = {2023}
}
Comments
5 pages