登录

Game total domination
[  作者:   人气:  创建时间: 2017/09/11   ]

报告题目: Game total domination

报告人:清华大学 陆玫 (教授 博导)

报告时间:2017917上午10:3011:30

报告地点:数统学院201

Abstract: 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, $\gama_{tg}(G)$ 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,  $\gama'_{tg}(G)$  is the number of vertices chosen when  Staller starts the game and both players play  optimally. In this talk, some results about $\gama_{tg}(G)$ and $\gama'_{tg}(G)$ will be given.

个人简介:陆玫,19937月在中国科学院数学与系统科学研究院获博士学位,现为清华大学数学科学系教授,博士生导师,主要从事运筹学、图论与组合优化方面的研究,发表SCI检索学术论文50余篇。现任清华大学数学科学系计算数学与运筹学研究所所长,中国运筹学会图论组合分会副理事长,中国工业与应用数学学会图论组合及应用专业委员会秘书长,中国组合数学与图论学会理事。

  
   返回
扫一扫关注湖北大学数统学院官方微信