Metraipolis › archive › dc_2c5732008d10
Rooted spanning forests in wheel graphs: Fibonacci-Lucas formulas and extremal root configurations — arXiv:2609.29486
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29486
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:40:56.188Z
- SHA-256 of the archived text
6e20011cbb06a50f2d94e1598ffd5380df14fb334ac1890731187bbdc54a0d54- Stable URL of this page
https://metraipolis.com/documento/dc_2c5732008d10
How to cite
Rooted spanning forests in wheel graphs: Fibonacci-Lucas formulas and extremal root configurations — arXiv:2609.29486 — arXiv (en), https://arxiv.org/abs/2609.29486 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c5732008d10 (Metraipolis archive dc_2c5732008d10, sha256 6e20011cbb06a50f2d94e1598ffd5380df14fb334ac1890731187bbdc54a0d54)
BibTeX
@misc{dc2c5732008d10,
title = {Rooted spanning forests in wheel graphs: Fibonacci-Lucas formulas and extremal root configurations — arXiv:2609.29486},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29486},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c5732008d10; sha256 6e20011cbb06a50f2d94e1598ffd5380df14fb334ac1890731187bbdc54a0d54},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29486. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we study rooted spanning forests in the wheel graph $W_{N+1}$. For a root set $R$ consisting of rim vertices, we give an explicit formula, in terms of Fibonacci and Lucas numbers, for the number of rooted spanning forests in which each connected component contains exactly one vertex of $R$. When the central vertex is also included in the root set, we obtain a simple product formula involving only Fibonacci numbers. Furthermore, by using the correspondence between rooted spanning forests and vertex identification, we derive explicit formulas for the number of spanning trees of quotient graphs of wheel graphs obtained by identifying several vertices into one vertex. We then rewrite the obtained formulas combinatorially in terms of the numbers of matchings in path graphs and cycle graphs. In addition, for a fixed number $r$ of rim root vertices, we express the sum of the numbers of rooted spanning forests over all rim root sets of size $r$ as coefficients of generating functions, and we solve the extremal problem for the arrangement of roots.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.29486 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T06:02:10.048Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).