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

燃烧数的结构性方法

A Structural Approach to Burning Number

Jean Guillaume, Tyriana Williams

AI总结:

本文从结构角度研究图燃烧数,刻画了燃烧数为2的图的结构,计算了分裂图和{K2+2K1, P4, C4}-自由图的燃烧数,并给出了研究社交网络燃烧数的蓝图。

摘要:

图燃烧是一种确定性离散时间过程,模拟网络中信息传播作为一组在图中蔓延的火。相关的图参数,燃烧数,衡量传播速度。图的燃烧数越小,信息在相应网络中传播越快。本文主要从结构角度研究燃烧数。特别地,我们结构性地刻画了所有燃烧数为2的图。然后我们计算了分裂图和$\{ K_2+2K_1, P_4, C_4\}$-自由图的燃烧数。特别地,我们证明了连通分裂图和连通$\{ K_2+2K_1, P_4, C_4\}$-自由图是易燃烧的。最后,我们提供了研究给定社交网络燃烧数的蓝图。

英文摘要:

Graph burning is a deterministic discrete-time process that models the propagation of information within a network as a set of fires that spread in a graph. The associated graph parameter, the burning number, measures the speed of that spread. The smaller the burning number of a graph is, the faster information spreads in the corresponding network. In this paper, we mainly study the burning number from a structural point of view. In particular, we structurally characterize all graphs with burning number 2. We then proceed to compute the burning number of split graphs and $\{ K_2+2K_1, P_4, C_4\}$-free graphs. In particular, we show that connected split graphs and connected $\{ K_2+2K_1, P_4, C_4\}$-free graphs are well-burnable. Lastly, we provide a blueprint on how to investigate the burning number of a given social network.

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

↑