Graph Labelings and Tournament Scheduling
2015-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Graph Labelings and Tournament Scheduling
Authors
Published Date
2015-05
Publisher
Type
Thesis or Dissertation
Abstract
During my research I studied and became familiar with distance magic and distance antimagic labelings and their relation to tournament scheduling. Roughly speaking, the relation is as follows. Let the vertices on the graph represent teams in a tournament, and let an edge between two vertices a and b represent that team a will play team b in the tournament. Further, suppose we can rank the teams based on previous games, say, the preceding season. These integer rankings become labels for the vertices. Of particular interest were handicap tournaments, that is, tournaments designed to give each team a more balanced chance of winning.
Description
University of Minnesota M.S. thesis. May 2015. Major: Applied and Computational Mathematics. Advisor: Dalibor Froncek. 1 computer file (PDF); viii, 55 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Shepanik, Aaron. (2015). Graph Labelings and Tournament Scheduling. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/174714.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.