| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652207 | Electronic Notes in Discrete Mathematics | 2013 | 5 Pages |
Abstract
We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the hth power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the number of edges of the diagram is obtained by convolution of a Fibonacci-like sequence with itself.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
