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

图燃烧数的一个上界

An Upper Bound on Burning Number of Graphs

Max Land, Linyuan Lu

摘要:

图$G$的燃烧数$b(G)$由Bonato,Janssen和Roshanbin [计算机科学讲义8882(2014)]引入,用于测量图中传染病传播的速度。他们证明了对于任意连通图$G$的阶为$n$,$b(G)\leq 2\lceil \sqrt{n} \rceil-1$,并证明了$b(G)\leq \lceil \sqrt{n} \rceil$ .本文证明了$b(G)\leq \lceil\frac{-3+\sqrt{24n+33}}{4}\rceil$,它大致是$\frac{\sqrt{6}}{2}\sqrt{n}$ .我们还解决了Bonato-Janssen-Roshanbin的以下猜想:如果$G$和$\bar G$都连接,则为$b(G)b(\bar G)\leq n+4$。

英文摘要:

The burning number $b(G)$ of a graph $G$ was introduced by Bonato, Janssen, and Roshanbin [Lecture Notes in Computer Science 8882 (2014)] for measuring the speed of the spread of contagion in a graph. They proved for any connected graph $G$ of order $n$, $b(G)\leq 2\lceil \sqrt{n} \rceil-1$, and conjectured that $b(G)\leq \lceil \sqrt{n} \rceil$. In this paper, we proved $b(G)\leq \lceil\frac{-3+\sqrt{24n+33}}{4}\rceil$, which is roughly $\frac{\sqrt{6}}{2}\sqrt{n}$. We also settled the following conjecture of Bonato-Janssen-Roshanbin: $b(G)b(\bar G)\leq n+4$ provided both $G$ and $\bar G$ are connected.

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

↑