Abstract
The tournament design based on Hamiltonian paths or cycles is an all-play-all or a round-robin tournament. For n groups or players, it takes (n – 1) day periods and every player or a group plays one another in a sports arena not more than two-times. Moreover, number of matches conducted in every sports arena forms a Hamiltonian cycle. Formerly, an inductive proof has been given for development of Hamiltonian path tournament structure. In this paper, it has been shown for n = 2p ≥ 8 (p ≥ 3). Here, we give an algorithmic proof, which constructs Hamiltonian cycle for a balanced tournament design having n groups. This algorithmic validation, completes the inductive proof for practical means.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
