Please use this identifier to cite or link to this item:
Title: Graph factorization and hamilton path based balanced tournament design
Authors: Desh Deepak, Pathak
Supervisor: Kumar, Ravinder
Keywords: 1-factor;Balanced tourmament;hamilton path
Issue Date: 2-Aug-2013
Abstract: A Hamilton path tournament design is based on round-robin tournament. For n teams, It takes (n 1) days and each team plays in each stadium not more than twice. Moreover, the set of matches played in each stadium forms a Hamilton path. Formerly, an inductive proof has been given for the construction of Hamilton path tournament designs. It was shown for n = 2p 8(p 3). Here, I provide an algorithmic proof which constructs Hamilton path tournament designs for n = 2 p 8(p 3) teams. It completes the inductive proof for practical means.
Description: Master of Engineering (Software Engineering)
Appears in Collections:Masters Theses@CSED

Files in This Item:
File Description SizeFormat 
2235.pdf874.84 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.