Maximal hypercubes in Fibonacci and Lucas cubes
Copyright policy )Maximal hypercubes in Fibonacci and Lucas cubes
The Fibonacci cube $Γ_n$ is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $Λ_n$ is obtained from $Γ_n$ by removing vertices that start and end with 1. We characterize maximal induced hypercubes in $Γ_n$ and $Λ_n$ and deduce for any $p\leq n$ the number of maximal $p$-dimensional hypercubes in these graphs.
- Grenoble Alpes University France
- Joseph Fourier University France
- Institut Fourier France
Extremal problems in graph theory, Applied Mathematics, Lucas cubes, Cube polynomials, Hypergraphs, Enumeration in graph theory, hypercubes, cube polynomials, Fibonacci cubes, FOS: Mathematics, Fibonacci and Lucas numbers and polynomials and generalizations, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypercubes
Extremal problems in graph theory, Applied Mathematics, Lucas cubes, Cube polynomials, Hypergraphs, Enumeration in graph theory, hypercubes, cube polynomials, Fibonacci cubes, FOS: Mathematics, Fibonacci and Lucas numbers and polynomials and generalizations, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypercubes
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).15 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!