arXiv (All)
open access
Rooted spanning forests in wheel graphs: Fibonacci-Lucas formulas and extremal root configurations
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 o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Most A$_α$-eigenvalues of a tree are small#1131269
- Aureobasidium smielowskii tree#629462
- The height of discrete-time critical beta-splitting trees#1012358
- FG-LCNet: A two-stage foreground-guided network for whole-tree litchi counting.#1001154
- A robust phylogenetic framework for ophiostomatoid fungi: orders Ophiostomatales and Microascales (Sordariomycetes, Ascomycota)#990779
Record · ID 1077415
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive