講座主題：Game total domination
專家姓名：陸玫
工作單位：清華大學
講座時間：2017年10月15日11:00-12:00
講座地點：數學學院340
主辦單位：煙臺大學數學與信息科學學院
內容摘要：
Let G = (V, E) be a simple graph without isolated vertices. The total domination game, played on a graph G consists of two players called Dominator and Staller who take turns choosing a vertex from G. Each chosen vertex must totally dominate at least one vertex not totally dominated by the set of vertices previously chosen. The game ends when the set of vertices chosen is a total dominating set in G. Dominator’s objective is to minimize the number of vertices chosen, while Staller’s is to end the game with as many vertices chosen as possible. The game total domination number is the number of vertices chosen when Dominator starts the game and both players employ a strategy that achieves their objective. The Staller-start game total domination number is the number of vertices chosen when Staller starts the game and both players play optimally. In this talk, some results about the game total domination number and the Staller-start game total domination number will be given.
主講人介紹：
陸 玫，1993年7月在中國科學院數學與系統科學研究院獲博士學位，現為清華大學數學科學系教授，博士生導師，主要從事運籌學、圖論與組合優化方面的研究，在《Journal of Combinatorial Theory, Series B》、 《Journal of Graph Theory》、 《Linear Algebra and Applications》、《Discrete Applied Mathematics》、《Discrete Mathematics》、《Journal of Combinatorial Optimization》等國際權威學術期刊發表SCI檢索論文60余篇。現任清華大學數學科學系計算數學與運籌學研究所所長，中國運籌學會圖論組合分會副理事長，中國工業與應用數學學會圖論組合及應用專業委員會秘書長，中國組合數學與圖論學會理事。
