Indian Institute of Science(印度科学学院);Indian Institute of Science Education and Research, Thiruvananthapuram(印度科学教育与研究学院(特里凡得琅));Manipal Academy of Higher Education(马纳帕高等教育学院);Indian Institute of Technology Delhi(德里印度理工学院);Kyoto University(京都大学)
Graph burning is a discrete-time process that models the propagation of information in a network. Given an undirected graph whose vertices are initially unburned, the process evolves in discrete rounds. At each round, an unburned vertex is selected and burned, while any unburned vertex adjacent to a vertex burned in the previous round also becomes burned. The burning number of a graph is the minimum number of steps to burn all its vertices. The BURNING NUMBER PROBLEM asks whether the burning number of an input graph $G$ is at most $k$. In this paper, we investigate the graph burning problem from both algorithmic and structural viewpoints. Although the problem is known to be NP-complete on interval graphs, we strengthen this result by proving that it remains NP-complete even when restricted to connected proper interval graphs. We also study the burning number of $P_k$-free graphs. Motivated by the well-known burning number conjecture, which states that every connected graph of order $n$ has burning number at most $\lceil \sqrt{n}~\rceil$, we establish an improved upper bound for connected $P_k$-free graphs and show that this bound is tight up to an additive constant of $1$. Finally, we study two variants of the problem: edge burning and total burning. We establish fundamental relationships between these variants and the classical burning, and we determine the computational complexity of the corresponding decision problems.
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(京都大学)
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(诺维萨德大学理学院数学与信息系)
受图论过程的启发,该过程旨在测量图中传染病传播的速度,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…
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(诺维萨德大学理学院数学与信息学系)