q -cube polynomial of Tribonacci cube
RAIRO - Operations Research · 2026-07 · 60 (4) · 2361-2374
DOI: 10.1051/ro/2026074 ↗Kurz gefasst
Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 05.08.2026. Verfasst von Hacène Belbachir und 1 weiteren Autor:innen. Die Arbeit nennt 37 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: DGRSDT.
Abstract (Originalsprache)
Tribonacci cubes, also known as third generalized Fibonacci cubes, are subgraphs of the d-cube induced by the set of binary strings that do not contain three consecutive 1’s. We investigate the number of hypercubes at a certain distance from the null-weight vertex in Tribonacci cubes, where the weight of a vertex is determined by the number of 1’s it contains. The counting polynomial of these cubes is called the q -cube polynomial. We provide a recurrence relation for the q -cube polynomial of Tribonacci cubes. Additionally, we derive a formula for the k th coefficient of these polynomials, expressed in terms of the Tricobsthal polynomial. Finally, we determine the generating function for these coefficients.
Förderung
- DGRSDT
Zitieren
APA
Belbachir, H., & Ould-Mohamed, R. (2026). q -cube polynomial of Tribonacci cube. RAIRO - Operations Research, 60(4), 2361-2374. https://doi.org/10.1051/ro/2026074
Vancouver
Belbachir H, Ould-Mohamed R. q -cube polynomial of Tribonacci cube. RAIRO - Operations Research. 2026;60(4):2361-2374. doi:10.1051/ro/2026074
BibTeX
@article{Belbachir2026,
author = {Belbachir, Hacène and Ould-Mohamed, Ryma},
title = {q -cube polynomial of Tribonacci cube},
journal = {RAIRO - Operations Research},
year = {2026},
volume = {60},
number = {4},
pages = {2361--2374},
doi = {10.1051/ro/2026074}
}
EUVIMED