Spanning trees of Fibonacci graphs and a bijection to pattern-avoiding words

For the Fibonacci graph $$F_n=P_n^2$$ , it is known that the number of spanning trees is the even-indexed Fibonacci number $$\operatorname {Fib}_{2n-2}$$ ; 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.

Authors

Institutions

Publication Details

Journal
Acta Universitatis Sapientiae Mathematica
Published
2026-11-13
DOI
https://doi.org/10.1007/s44426-026-00081-9
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Spanning trees of Fibonacci graphs and a bijection to pattern-avoiding words

Handan Akyar, Emrah Akyar
Acta Universitatis Sapientiae Mathematica
Advanced Combinatorial Mathematics
article

Spanning trees of Fibonacci graphs and a bijection to pattern-avoiding words

Handan Akyar, Emrah Akyar
article en

Abstract

For the Fibonacci graph $$F_n=P_n^2$$ , it is known that the number of spanning trees is the even-indexed Fibonacci number $$\operatorname {Fib}_{2n-2}$$ ; 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.

Acta Universitatis Sapientiae MathematicaVol. 18(1)
Eskisehir Technical University (TR)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon