论文标题
游戏统治号码上的一般上限
General upper bound on the game domination number
论文作者
论文摘要
可以猜想的是，对于不包含隔离顶点的每$ n $ vertex图，游戏支配号码最多是$ 3N/5 $。近年来，猜想对几个图形类别（包括森林类别和最低程度至少两个图形的图表）证明。在这里，我们证明，略大的上限$ 5N/8 $对于每个无分离图的图都是有效的。
It is conjectured that the game domination number is at most $3n/5$ for every $n$-vertex graph which does not contain isolated vertices. It was proved in the recent years that the conjecture holds for several graph classes, including the class of forests and that of graphs with minimum degree at least two. Here we prove that the slightly bigger upper bound $5n/8$ is valid for every isolate-free graph.
