Counting spanning trees of (1, N)-periodic graphs

Jingyuan Zhang, Fuliang Lu, Xian'an Jin

Let $N\ge 2$ be an integer, a (1, $N$)-periodic graph $G$ is a periodic graph whose vertices can be partitioned into two sets $V_1=\{v\mid \sigma (v)=v\}$ and $V_2=\{v\midσ^i(v)\neq v\ \…