The number of tournaments with a unique spanning cycle
J. W. Moon · Journal of Graph Theory · 1982
Abstract The number of tournaments Tn on n nodes with a unique spanning cycle is the (2n‐6)th Fibonacci number when n ≥ 4. Another proof of this result is given based on a recursive construction of these tournaments.