Counting Trees in a Certain Class of Graphs
Daniel J. Kleitman, Bruce Golden · American Mathematical Monthly · 1975
The number of trees contained in a certain class of graphs is obtained by a simple argument. The graphs can be represented by choosing the integers from 1 to n as vertices and connecting vertices whose difference mod n is one or two. The answer is n times the square of the nth Fibonacci number.