TY  - JOUR
ID  - Mojdeh2017
LB  - Mojdeh2017
AU  - Mojdeh, D. A.
AU  - Samadi, B.
TI  - On the inverse signed total domination number in graphs
ST  - On the inverse signed total domination number in graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2017
VL  - 37
IS  - 3
SP  - 447
EP  - 456
DO  - http://dx.doi.org/10.7494/OpMath.2017.37.3.447
UR  - http://dx.doi.org/10.7494/OpMath.2017.37.3.447
AB  - In this paper, we study the inverse signed total domination number in graphs and present new sharp lower and upper bounds on this parameter. For example by making use of the classic theorem of Turán (1941), we present a sharp upper bound on \(K_{r+1}\)-free graphs for \(r\geq 2\). Also, we bound this parameter for a tree from below in terms of its order and the number of leaves and characterize all trees attaining this bound.
KW  - inverse signed total dominating function
KW  - inverse signed total domination number
KW  - \(k\)-tuple total domination number
SN  - 1232-9274
ER  -