Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6872105 | Discrete Applied Mathematics | 2015 | 5 Pages |
Abstract
The Fibonacci cube of dimension n, denoted as În, is the subgraph of n-cube Qn induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in În isomorphic to Qk, and denote this number by qk(n). We prove several recursive results for qk(n), in particular we prove that qk(n)=qkâ1(nâ2)+qk(nâ3). We also prove a closed formula in which qk(n) is given in terms of Fibonacci numbers, and finally we give the generating function for the sequence {qk(n)}n=0â.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sylvain Gravier, Michel Mollard, Simon Å pacapan, Sara Sabrina ZemljiÄ,