Abstract
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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
