期刊文献+

哈林图的防火问题

On the firefighter problem of Halin graphs
下载PDF
导出
摘要 将哈林图的特征树剖分成长路集合和短路集合的并,通过讨论这些路和树的存活数的下界,进而研究了哈林图的防火问题,证明了:若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
  • 相关文献

参考文献8

  • 1Cai Leizhen,Wang Weifan.The surviving rate of a graph for the firefighter problem[J].SlAM J Discrete Math,2009,23 (4):1814-1826.
  • 2Wang Weifan,Finbow S,Wang Ping.The surviving rate of an infected network[J].Theoretical Computer Science,2010,411 (40/41/42):3651-3660.
  • 3Finbow S,King A,MacGillivraya G,et al.The firefighter problem for graphs of maximum degree three[J].Discrete Math,2007,307 (16):2094-2105.
  • 4Wang Ping,Moeller S A.Fire control on graphs[J].J Comb Math Comb Comp,2002,41:19-34.
  • 5Finbow S,Hartnell B,Li Q.On minimizing the effects of fire or a virus on a network[J].J Comb Math Comb Comp,2000,33:311-322.
  • 6Chan W H,Peter C B L am,Shiu W C.Edge-face total chromatic number of Halin graphs[J].SIAM J Discrete Math,2009,23 (3):1646-1654.
  • 7Chen Min,Wang Weifan.The 2-dipath chromatic number of Halin graphs[J].Inform Process Lett,2006,99(2):47-53.
  • 8Stadler P F.Minimum cycle bases of Halin graphs[J].J Graph Theory,2003,43(2):150-155.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部