On the Game Domination Number of Graphs with Given Minimum Degree

[摘要] In the domination game, introduced by Brešar, Klavžar, and Rall in 2010, Dominator and Staller alternately select a vertex of a graph $G$. A move is legal if the selected vertex $v$ dominates at least one new vertex – that is, if we have a $u\in N[v]$ for

[学科分类] 离散数学和组合数学

[关键词] Domination game;Game domination number;3/5-conjecture;Minimumdegree