摘要
将哈林图的特征树剖分成长路集合和短路集合的并,通过讨论这些路和树的存活数的下界,进而研究了哈林图的防火问题,证明了:若H是一个点数为n的哈林图,那么limn→∞2ρ(H)=1.所得结果改进了现有文献的相关结果.
Via partitioning the rooted tree of Halin graph into long paths and short trees,the surviving rate of those paths and trees were discussed,the firefighter problem of Halin graph was considered.It was obtained that limn→∞ρ2(H)=1 for a Halin graph H with n vertices.This improved the existing results in literatures.
出处
《浙江师范大学学报(自然科学版)》
CAS
2011年第2期141-144,共4页
Journal of Zhejiang Normal University:Natural Sciences
基金
国家自然科学基金资助项目(10771197)
浙江省自然科学基金重点资助项目(Z6090150)
关键词
防火问题
存活数
存活率
哈林图
firefighter problem
surviving number
surviving rate
Halin graph