New Bounds on the Signed Total Domination Number of Graphs

Seyyed Mehdi Hosseini Moghaddam, et al. "New Bounds on the Signed Total Domination Number of Graphs." Discussiones Mathematicae Graph Theory 36.2 (2016): 467-477. <http://eudml.org/doc/277117>.

@article{SeyyedMehdiHosseiniMoghaddam2016,
abstract = {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.},
author = {Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {open packing; signed total domination number; total limited packing; tuple total domination number},
language = {eng},
number = {2},
pages = {467-477},
title = {New Bounds on the Signed Total Domination Number of Graphs},
url = {http://eudml.org/doc/277117},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Seyyed Mehdi Hosseini Moghaddam
AU - Doost Ali Mojdeh
AU - Babak Samadi
AU - Lutz Volkmann
TI - New Bounds on the Signed Total Domination Number of Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 2
SP - 467
EP - 477
AB - 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.
LA - eng
KW - open packing; signed total domination number; total limited packing; tuple total domination number
UR - http://eudml.org/doc/277117
ER -