arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.11328math.CO
收藏

燃烧博弈

The burning game on graphs

University of Primorska(普里莫斯卡大学);Faculty of Mathematics and Physics, University Ljubljana(卢布尔雅那大学数学物理学院);Institute of Mathematics, Physics and Mechanics, Ljubljana(卢布尔雅那数学、物理与力学研究所);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院);Department of Mathematics and Applied Mathematical Sciences, University of Rhode Island(罗德岛大学数学与应用数学科学系);Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad(诺维萨德大学理学院数学与信息学系)

Nina Chiarelli, Vesna Iršič, Marko Jakovac, William B. Kinnersley, Mirjana Mikalački

AI总结:

该研究提出了由燃烧者和阻止者参与的图燃烧博弈,定义了两类博弈燃烧数,推导了其基本界与延拓原理,刻画了小燃烧数图的特征,得到Nordhaus-Gaddum型结果并探讨了相关猜想与图乘积问题。

摘要:

受燃烧与冷却过程的启发,研究者提出了燃烧博弈。该博弈在图$G$上进行,由两名玩家(燃烧者与阻止者)轮流选择$G$的顶点进行燃烧;与燃烧过程一致,已燃烧顶点会将火势蔓延至未燃烧的邻居。燃烧者的目标是尽快烧完$G$的所有顶点,而阻止者则希望该过程持续尽可能长的时间。若两名玩家均采取最优策略,当燃烧者先手时,烧完整个图$G$所需的时间步数为博弈燃烧数$b_g(G)$;当阻止者先手时,则为阻止者先手博弈燃烧数$b_g'(G)$。本文给出了$b_g(G)$的基本界,建立了延拓原理(Continuation Principle),刻画了具有较小博弈燃烧数的图的特征,得到了Nordhaus-Gaddum型结果,探讨了燃烧博弈的燃烧数猜想的类似问题,并研究了图乘积相关内容。

英文摘要:

Motivated by the burning and cooling processes, the burning game is introduced. Two players (Burner and Staller) play the game on a graph $G$ by alternately selecting vertices of $G$ to burn; as in the burning process, burning vertices spread fire to unburned neighbors. Burner aims to burn all vertices of $G$ as quickly as possible, while Staller wants the process to last as long as possible. If both players play optimally, then the number of time steps needed to burn the whole graph $G$ is the game burning number $b_{\rm g}(G)$ if Burner makes the first move, and the Staller-start game burning number $b_{\rm g}'(G)$ if Staller starts. In this paper, basic bounds on $b_{\rm g}(G)$ are given and several fundamental properties of the burning game established. Graphs with small game burning numbers are characterized and the game is studied on paths and cycles. An analogue of the burning number conjecture for the burning game is also considered. Finally, it is shown that the problem of determining whether or not $b_{\rm g}(G) \le k$ is NP-hard.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑