The Fibonacci cube is the subgraph of the hypercube induced by the vertices whose binary string representations do not contain two consecutive 1s. These cubes were presented as an alternative interconnection network. In this paper, we calculate the number of induced paths and cycles of small length in Fibonacci cubes by using the recursive structure of these graphs.

中文翻译：

---

斐波那契立方体中的短周期数

斐波那契立方体是由顶点诱导的超立方体的子图，这些顶点的二进制字符串表示形式不包含两个连续的1。这些多维数据集是作为替代互连网络提出的。在本文中，我们通过使用这些图的递归结构来计算斐波纳契立方体中的诱导路径和小长度循环的数量。