Self-Converse Tournaments
Author:
- W. J. R. EplettWEW. J. R. Eplett
- 1 March 1979
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 22 (1) , 23-27
Abstract
Let Tn denote a tournament with vertices labelled 1, …, n. Any undefined terms can be found in [5]. The converse of Tn is the tournament obtained by reversing the orientation of all the arcs in Tn. A tournament is called self-converse (s.c.) if . The transitive tournaments are examples of s.c. tournaments. In this paper we provide a structural characterization of s.c. tournaments and we also characterize the score vectors of s.c. tournaments.Keywords
This publication has 2 references indexed in Scilit:
- A new proof of a theorem by H. G. Landau on tournament matricesJournal of Combinatorial Theory, 1968
- On dominance relations and the structure of animal societies: III The condition for a score structureBulletin of Mathematical Biology, 1953