O-Fibonacci $(p,r)$-cube as Cartesian products
Combinatorics
2019-10-15 v1
Abstract
Let and be positive integers. Then the O-Fibonacci -cube is the subgraph of induced on the binary words in which there is at least zeros between any two s and there is at most consecutive . These cubes include a wide range of cubes as their special cases, such as hypercubes, Fibonacci cubes, and postal networks. In this note it is proved that is a non-trivial Cartesian product if and only if and .
Keywords
Cite
@article{arxiv.1910.05891,
title = {O-Fibonacci $(p,r)$-cube as Cartesian products},
author = {Jianxin Wei and Guangfu Wang},
journal= {arXiv preprint arXiv:1910.05891},
year = {2019}
}