报告题目：Some new results on k-power domination of graphs
报告专家：吕长虹教授，华东师范大学
报告时间：3月20日（周一）16：00-17：00
报告方式：腾讯会议，会议号：929-856-365
报告摘要：The domination problem of graphs is a classic problem in graph theory research. The k-power domination problem was born from the problem of monitoring electrical networks, and it is a generalization of the domination problem. S is a k-power dominating set of a graph G if and only if all vertices of G can finally obtain messages by the following two ways: (1) If u∈S, then u can send messages to itself and all its neighbors; (2) If a vertex u has messages and it has at most k neighbors without messages, then u can send messages to neighbors without messages. The minimum cardinality of k-power dominating sets is called k-power domination number. The k-power domination problem of graphs is to study the k-power domination number of graphs. When k = 0, the k-power domination problem is the domination problem. When k = 1, the k-power domination problem is the power domination problem. In this talk, we will report some new results in this area.
专家简介：吕长虹，华东师范大学数学科学学院教授，院长，国家高层次人才计划入选者，主要从事图论和离散优化方面理论和应用研究。在SIAM J. Disc Math、European J. Combin等学术期刊发表学术论文40余篇。 2020年获得上海市科技进步特等奖和萧树铁应用数学奖，2021年获CSIAM首届数学落地成果奖和华为优秀技术成果奖。现为中国数学会常务理事、中国工业与应用数学常务理事、上海市工业与应用数学学会副理事长、上海市运筹学会副理事长等。