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

Jun Yue, Yiping Zhu and Meiqin Wei

Applied Mathematics and Computation, 2020, vol. 380, issue C

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).

Keywords: Total domination number; Total dominating set; Annihilation number (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320302095
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:380:y:2020:i:c:s0096300320302095

DOI: 10.1016/j.amc.2020.125240

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().