Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
From MaRDI portal
Publication:505451
Abstract: The Fibonacci cube of dimension n, denoted as n , is the subgraph of n-cube Q n induced by vertices with no consecutive 1's. In this short note we prove that asymptotically all vertices of n are covered by a maximum set of disjoint subgraphs isomorphic to Q k , answering an open problem proposed in [2].
Recommendations
Cited in
(12)- On disjoint hypercubes in Fibonacci cubes
- Daisy cubes and distance cube polynomial
- On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees
- Fibonacci-run graphs. II: Degree sequences
- The structure of \(k\)-Lucas cubes
- Fibonacci-run graphs. I: Basic properties
- On the chromatic polynomial and the domination number of \(k\)-Fibonacci cubes
- Boundary enumerator polynomial of hypercubes in Fibonacci cubes
- Some diameter notions of Fibonacci cubes
- Counting disjoint hypercubes in Fibonacci cubes
- \(k\)-Fibonacci cubes: a family of subgraphs of Fibonacci cubes
- On the domination number and the total domination number of Fibonacci cubes
This page was built for publication: Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505451)