学术报告会：Relating the total domination number and the annihilation number for some graphs

报告题目： Relating the total domination number and the annihilation number for some graphs

报 告 人：    华洪波    (淮安大学  教授)

报告时间：2026年6月19日周五09：00

腾讯会议ID：228-594-770

Abstract：The total domination number γ(G)of a graph G is the cardinality of a smallest vertex set D such that each vertex of G has a neighbor in D. The annihilation number a(G) of G is the largest integer k such that there exist k different vertices in G with the degree sum at most the size of G. It is conjectured by Desormeaux et al. that γ(G) ≤a(G)+1 holds for every nontrivial connected graph G. The conjecture has been proved by some other authors for graphs with minimum degree at least 3, trees, certain tree-like graphs, block graphs, and cactus graphs. In this talk, we introduce our results about the above conjecture.

个人简介：

华洪波，博士，博士后，淮安大学教授，硕士生导师，曾担任校学术委员会委员和数学学科带头人。先后被遴选为江苏省“青蓝工程”优秀青年骨干教师培养对象及江苏省“青蓝工程”中青年学术带头人培养对象。目前担任中国工业与应用数学学会图论组合及应用专业委员会委员。先后主持国家自然科学基金面上项目2项，主持完成江苏省高校自然科学基金面上项目及中国博士后科学基金面上项目各1项，参与完成国家自然科学基金2项及省基金1项。迄今为止，共发表SCI论文70余篇。