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
备注:
This is the replacement of the first version of the file, that was further developed and then split into two papers. The first one, this, is published in Discrete Mathematics, and this is its final version, and the second one, about further results on the burning game, including Nordhaus-Gaddum bounds and bounds for four graph products on the game burning number is uploaded as a new submission
发表信息:
N. Chiarelli, V. Iršič Chenoweth, M. Jakovac, W. B. Kinnersley, M. Mikalački, The burning game on graphs, Discrete Mathematics, Volume 349, Issue 5, 2026, 115027, ISSN 0012-365X
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.
On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products
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(马里博尔大学自然科学与数学学院);University of Rhode Island(罗德岛大学);Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad(诺维萨德大学理学院数学与信息系)
Indian Institute of Science(印度科学学院);Indian Institute of Science Education and Research, Thiruvananthapuram(印度科学教育与研究学院(特里凡得琅));Manipal Academy of Higher Education(马纳帕高等教育学院);Indian Institute of Technology Delhi(德里印度理工学院);Kyoto University(京都大学)
受图论过程的启发,该过程旨在测量图中传染病传播的速度,Bonato,Janssen和Roshanbin [Burning a Graph as a Model of Social Contagion,计算机科学讲义8882(2014)13-22]定义图$G$的燃烧数$b(G)$为最小整数$k$,对于该最小整数,存在顶点$x_1,\ldots,x_k$,使得对于每个顶点$G$的$u$,有一些$i\in \{ 1,\ldots,k\}$与${\rm dist}_G(u,x_i)\leq k-i$,和${\rm dist}_G(x_i,x_j)\geq j-i$为每个$i,j\in \{ 1,\ldots,k\}$。对于$n$阶的连通图$G$,证明了$b(G)\leq 2\left\lceil\sqrt{n}\right\rceil-1$,并猜想了$b(G)\leq \left\lceil\sqrt{n}\right\rceil$ .我们证明了对于每一个阶为$n$的连通图$G$和每一个$0<ε<1$,都有$b(G)\leq \sqrt{\frac{32}{19}\cdot \frac{n}{1-ε}}+\sqrt{\frac{27}{19ε}}$和$b(G)\leq \sqrt{\frac{12n}{7}}+3\approx 1.309 \sqrt{n}+3$.对于一棵树$T$的顺序$n…
Hardness of Burning Number Problem on Regular Graphs
Indian Institute of Science Education and Research Thiruvananthapuram(印度科学教育研究所特里凡得琅分校);Indian Institute of Science, Bengaluru(印度科学学院班加罗尔分校);Manipal Academy of Higher Education(马尼帕尔高等教育学院);Indian Institute of Technology Delhi(德里印度理工学院);Kyoto University(京都大学)