CN EN

理学院2018-2019学年夏季第六周学术报告(2)


学 术 报 告


报告题目: Total domination number of central trees


报告学者:  Moo Young Sohn 教授


报告者单位Changwon National University, Republic of Korea


报告时间2019年8月11日下午15:40-16:20


报告地点学生活动中心10层1005


摘要: Let $\gamma_{t}(G)$ and $\tau(G)$ denote the total domination number and vertex cover number of graph $G$, respectively. In this talk, we study the total domination number of the central tree $C(T)$.  First, a relationship between the total domination number of $C(T)$ and the vertex cover number of tree $T$ are discussed. We characterize the central trees with equal total domination number and independent number. Applying the first result, we improved the upper bound on the total domination number of $C(T)$ and solved one open problem posed by Kazemnejad et al..


主办教师:冯衍全

欢迎广大同学老师积极踊跃参加!