Independent subsets of powers of paths, and Fibonacci cubes

DOI10.1016/J.ENDM.2013.05.013MaRDI QIDQ6237041zbMATH OpenFDO

Authors Pietro Codara, Ottavio M. D'Antona

Publication date 9 November 2012

Full work available at URL https://doi.org/10.1016/J.ENDM.2013.05.013

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Combinatorics in computer science (68R05)

Abstract: We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th 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.

This page was built for publication: Independent subsets of powers of paths, and Fibonacci cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237041)