题目：On the domination game of graphs

报告人：许克祥 南京航空航天大学

时间：7月21号下午2：00-2：45，地点：1518

摘要：

The domination game played on a graph G consists of two players, Dominator and Staller, who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay the process as much as possible. The game domination number γg(G) (resp., γ0 g(G)) is the number of vertices chosen when Dominator (resp., Staller) starts the game and both players play optimally. In the talk we report the recent results on the game domination number of graphs. In particular, we present some results on the graphs G with maximal γg(G) and introduce two new related definitions to the game domination number. Moreover, some interesting open problems are proposed on the domination game of graphs.