Burning Numbers of Barbells  

作　　者：Hui-qing LIU Rui-ting ZHANG Xiao-lan HU 

机构地区：[1]Hubei Key Laboratory of Applied Mathematics&Faculty of Mathematics and Statistic,Hubei University,Wuhan 430062,China [2]Hubei Key Laboratory of Mathematical Sciences&School of Mathematics and Statistics,Central China Normal University,Wuhan 430079,China

出　　处：《Acta Mathematicae Applicatae Sinica》2024年第2期526-538,共13页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(Nos.11971158,12371345,11971196).

摘　　要：Motivated by a discrete-time process intended to measure the speed of the spread of contagion in a graph,the burning number b(G)of a graph G,is defined as the smallest integer k for which there are vertices x1,…xk such that for every vertex u of G,there exists i∈{1,…k}with dG(u,xi)≤k−i,and dG(xi,xj)≥j−i for any 1≤i<j≤k.The graph burning problem has been shown to be NP-complete even for some acyclic graphs with maximum degree three.In this paper,we determine the burning numbers of all short barbells and long barbells,respectively.

关 键 词：burning number short/long barbell isometric subtree CYCLE 

分 类 号：O157.5[理学—数学]