TY  - JOUR
ID  - Atapour2016
LB  - Atapour2016
AU  - Atapour, M.
AU  - Norouzian, S.
AU  - Sheikholeslami, S. M.
AU  - Volkmann, L.
TI  - Bounds on the inverse signed total domination numbers in graphs
ST  - Bounds on the inverse signed total domination numbers in graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2016
VL  - 36
IS  - 2
SP  - 145
EP  - 152
DO  - http://dx.doi.org/10.7494/OpMath.2016.36.2.145
UR  - http://dx.doi.org/10.7494/OpMath.2016.36.2.145
AB  - Let \(G=(V,E)\) be a simple graph. A function \(f:V\rightarrow \{-1,1\}\) is called an inverse signed total dominating function if the sum of its function values over any open neighborhood is at most zero. The inverse signed total domination number of \(G\), denoted by \(\gamma_{st}^0(G)\), equals to the maximum weight of an inverse signed total dominating function of \(G\). In this paper, we establish upper bounds on the inverse signed total domination number of graphs in terms of their order, size and maximum and minimum degrees.
KW  - inverse signed total dominating function
KW  - inverse signed total domination number
SN  - 1232-9274
ER  -