  In this paper, we study the inverse signed total domination number in graphs
and present new lower and upper bounds on this parameter. For example by making
use of the classic theorem of Turan (1941), we present a sharp upper bound for
graphs with no induced complete subgraph of order greater than two. Also, we
bound this parameter for a tree in terms of its order and the number of leaves
and characterize all trees attaining this bound.
