The annihilation number and the total domination number of a tree-like graph

作者：

Highlights：

•

摘要

In the work, we prove that γt(F)≤a(F)+1 holds for a tree-like graph F, where γt(F) and a(F) denote the total domination number and annihilation number of a connected graph F, respectively. This result generalizes some results of Desormeaux et al. (2013) and Bujtás and Jakovac (2019).

论文关键词：Total domination number,Total dominating set,Annihilation number

论文评审过程：Received 29 December 2019, Revised 14 March 2020, Accepted 16 March 2020, Available online 17 April 2020, Version of Record 17 April 2020.

论文官网地址：https://doi.org/10.1016/j.amc.2020.125240