The number of tournaments with a unique spanning cycle
- 1 September 1982
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 6 (3) , 303-308
- https://doi.org/10.1002/jgt.3190060306
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.Keywords
This publication has 3 references indexed in Scilit:
- On enumerating tournaments that admit exactly one Hamiltonian circuitJournal of Combinatorial Theory, Series B, 1972
- Tournaments That Admit Exactly One Hamiltonian CircuitProceedings of the London Mathematical Society, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969