Please use this identifier to cite or link to this item: http://ithesis-ir.su.ac.th/dspace/handle/123456789/2776
Title: Game domination numbers of a disjoint union of chains and cycles of complete graphs
ค่าโดมิเนชันเกมของยูเนียนของโซ่และวัฏจักรของกราฟบริบูรณ์
Authors: Nattakritta CHANTARACHADA
ณัฐกฤตา ฉันทรัชดา
Chalermpong Worawannotai
เฉลิมพงศ์ วรวรรโณทัย
Silpakorn University. Science
Keywords: Domination game Game domination number Disjoint union of chains and cycles of complete graphs
Issue Date:  18
Publisher: Silpakorn University
Abstract:             The domination game played on a graph G consists of two players, Dominator and Staller, who alternate taking turns choosing a vertex fromG such that whenever a vertex is chosen, at least one additional vertex is dominated. Playing a vertex will make all vertices in its closed neighborhood dominated. The game ends when all vertices are dominated i.e. the chosen vertices form a dominating set. Dominator’s goal is to finish the game as soon as possible, and Staller’s goal is to prolong it as much as possible. The game domination number is the total number of chosen vertices after the game ends when Dominator and Staller play the game by using optimal strategies. In this thesis, we determine the game domination numbers of a disjoint union of chains and cycles of complete graphs together with optimal strategies for Dominator and Staller.  
-
Description: Master of Science (M.Sc.)
วิทยาศาสตรมหาบัณฑิต (วท.ม)
URI: http://ithesis-ir.su.ac.th/dspace/handle/123456789/2776
Appears in Collections:Science

Files in This Item:
File Description SizeFormat 
60305202.pdf2.26 MBAdobe PDFView/Open


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