报告题目：Game total domination
报告摘要： Let G = (V;E) be a simple graph without isolated vertices. A total dominating set of G is a set S of vertices of G such that every vertex of G is totally dominated by a vertex in S. 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 wishes to totally dominate the graph as fast as possible, while Staller wishes to delay the process as much as possible. The game total domination number of Gis the number of vertices chosen when Dominator starts the game and both players play optimally. The Staller-start game total domination number of Gis the number of vertices chosen when Staller starts the game and both players play optimally. In this talk, the game total domination number and the Staller-start game total domination number of Gwhen Gis a cyclic bipartite graph.