On the number of spanning trees of bicirculant graphs

Jing Yang, Fangming Xian

A bi-Cayley graph over a cyclic group ${\mathbb{Z}}_n$ is called a bicirculant graph. Let $\hat{I}“=BC({\mathbb{Z}}_n;R,T,S)$ be a bicirculant graph with $R=R^{-1}\subseteq \mathbb{Z}_n\set…