报告主题：图的燃烧数
报告人：刘慧清 教授 （湖北大学）
报告时间：2020年12月30日（周三） 14:00
会议形式：腾讯会议
会议 ID：907 232 790
邀请人：康丽英
报告摘要：Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph G is the minimum number of steps in a graph burning process for G. It is shown that the graph burning problem is NP-complete even for trees and path-forests. In this talk, we will present some new results and still open problems related to burning number.
欢迎教师、学生参加！