Answers are grounded in this paper and cite their sources.
For the Fibonacci graph Fₙ=Pₙ² , it is known that the number of spanning trees is the even-indexed Fibonacci number Fib₂ₙ₋₂ ; the same numbers enumerate ternary words avoiding the consecutive pattern 01. We give a local, explicitly reversible bijection between these two families. The inverse is obtained by a unique reduction at the last vertex, which supplies a complete proof of surjectivity and injectivity. The bijection also preserves a natural statistic: the number of skip edges of a tree equals the number of 0’s and 1’s in its word. We derive the corresponding weighted spanning-tree polynomial, an explicit coefficient formula, a classical real-rooted factorization transferred to the skip-edge distribution, an exact expectation and an asymptotic normal law. Finally, we give an exact uniform sampling algorithm based on completion counts and analyze its complexity. Our contribution is the explicit structural correspondence and its refinements, rather than a new formula for the total number of spanning trees.
No takes yet. Share an insight, caveat, or question.
Akyar et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: