In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥ 2. Applying the concept of total limited packing we bound the signed total domination number of G with δ(G) ≥ 3 from above by [...] . Also, we prove that γst(T) ≤ n − 2(s − s′) for any tree T of order n, with s support vertices and s′ support vertices of degree two. Moreover, we characterize all trees attaining this bound.
@article{bwmeta1.element.doi-10_7151_dmgt_1871,
author = {Seyyed Mehdi Hosseini Moghaddam and Doost Ali Mojdeh and Babak Samadi and Lutz Volkmann},
title = {New Bounds on the Signed Total Domination Number of Graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {467-477},
zbl = {1334.05103},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1871}
}
Seyyed Mehdi Hosseini Moghaddam; Doost Ali Mojdeh; Babak Samadi; Lutz Volkmann. New Bounds on the Signed Total Domination Number of Graphs. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 467-477. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1871/