The number of rooted spanning forests of bicirculant graphs

Jing Yang, Lihua Feng, Rongrong Lu +1

A bi-Cayley graph over the cyclic group $({\mathbb{Z}}_n,+)$ is called a bicirculant graph. Let $\Gamma =BC({\mathbb{Z}}_n;R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\s…