$q$-counting hypercubes in Lucas cubes
From MaRDI portal
Publication:4633742
DOI10.3906/mat-1605-2zbMath1424.05154OpenAlexW2792358813MaRDI QIDQ4633742
Publication date: 3 May 2019
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1605-2
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (8)
The (non-)existence of perfect codes in Lucas cubes ⋮ Enumerative properties and cube polynomials of Tribonacci cubes ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ Alternate Lucas Cubes ⋮ The structure of $k$-Lucas cubes ⋮ Structure and enumeration results of matchable Lucas cubes ⋮ Daisy cubes and distance cube polynomial ⋮ Fibonacci and Lucas \(p\)-cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting disjoint hypercubes in Fibonacci cubes
- Cube polynomial of Fibonacci and Lucas cubes
- Maximal hypercubes in Fibonacci and Lucas cubes
- Structure of Fibonacci cubes: a survey
- On disjoint hypercubes in Fibonacci cubes
- \(q\)-cube enumerator polynomial of Fibonacci cubes
This page was built for publication: $q$-counting hypercubes in Lucas cubes