Tournament Matrices an Overview
The results of a round robin tournament can be represented as a matrix of zeros and ones, by ordering the players and placing a one in the (i,j) position if player i beat player j, and zeros otherwise. These matrices, called tournament matrices, can be represented by graphs, called tournament graphs...
Main Author: | Carlson, Russel O. |
---|---|
Format: | Others |
Published: |
DigitalCommons@USU
2002
|
Subjects: | |
Online Access: | https://digitalcommons.usu.edu/etd/7070 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=8162&context=etd |
Similar Items
-
Reachability in K-Colored Tournaments
Published: (2011) -
Obstructions for local tournament orientation completions
by: Hsu, Kevin
Published: (2020) -
REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING
by: Cheney, Gina Marie
Published: (2016) -
The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs
by: Bauman, Shane
Published: (2006) -
The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs
by: Bauman, Shane
Published: (2006)