Premium
The number of tournaments with a unique spanning cycle
Author(s) -
Moon J. W.
Publication year - 1982
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190060306
Subject(s) - fibonacci number , combinatorics , mathematics , spanning tree , tournament , discrete mathematics
The number of tournaments T n on n nodes with a unique spanning cycle is the (2 n ‐6)th Fibonacci number when n ≥ 4. Another proof of this result is given based on a recursive construction of these tournaments.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom