讲座主题：Game total domination

专家姓名：陆玫

工作单位：清华大学

讲座时间：2017年10月15日11:00-12:00

讲座地点：数学学院340

主办单位：hy590海洋之神平台数学与信息科学学院

内容摘要：

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余篇。现任清华大学数学科学系计算数学与运筹学研究所所长，中国运筹学会图论组合分会副理事长，中国工业与应用数学学会图论组合及应用专业委员会秘书长，中国组合数学与图论学会理事。