1. Doyle, P., Snell, L.: Random Walks and Electrical Networks. Carus Mathematical Monographs, vol. 22. Mathematical Association of America, Washington (1984)
2. Faase, F.J.: On the number of specific spanning subgraphs of the graphs g × pn. Ars Combinatorica 49, 129–154 (1998)
3. Kauers, M., Paule, P.: The Concrete Tetrahedron. Springer, New York (2011)
4. Raff, P.: Spanning Trees in Grid Graph.
https://arxiv.org/abs/0809.2551
5. Shalosh, B., Ekhad, N.J.A.: Sloane and Doron Zeilberger. Automated proof (or disproof) of linear recurrences satisfied by pisot sequences. Personal Journal of Shalosh B. Ekhad and Doron Zeilberger. Available from
http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/pisot.html