 Fibonacci transition-graph cycle count

A period-three orbit forces an interval-covering graph with adjacency matrixIts number of closed pointed length-$n$ itineraries is $\mathrm{tr}(A^n)=L_n$. Möbius removal of lower periods and division by $n$ give four primitive cyclic classes at $n=7$ and five at $n=8$.