홈 editorial content online
Volume 14 (2012)
No 1
Volume 13 (2011)
No 1
Volume 12 (2010)
No 1
Volume 11 (2009)
No 1, No 2
Volume 10 (2008)
No 1, No 2
Volume 9 (2006)
No 1, No 2
Volume 8 (2005)
No 1, No 2
Volume 7 (2004)
No 1, No 2
Volume 6 (2003)
No 1, No 2
Volume 5 (2002)
No 1, No 2
Volume 4 (2001)
No 1, No 2
Volume 3 (2000)
No 1
Volume 2 (1999)
No 1
Volume 1 (1998)
No 1

(1998 / vol.1 / no.1)
A Survey on Tournament Matrices(From the Combinatorial Matrix Theoretic Viewpoint)
Sangwook Ree, Youngmee Koh
Pages. 31-36     



A tournament is the record of a round-robin competition between
players. It is combinatorially represented by a digraph whose adjacency matrix
is called a tournament matrix. Tournament matrices enjoy many interesting
combinatorial properties. They can be studied combinatorial matrix theoretically
as well as graph theoretically. From the combinatorial matrix theoretic
viewpoint, some interesting recent results on them are summarized, and some
problems are mentioned.



1. Introduction
2. Special properties of tournament matrices
3. Ranking problems
4. Arc reversal problems
5. Multipartite tournament matrices with constant team size
6. Extensions



tournament matrices, score vectors, Perron values, multipartite tournament matrices



05, 15