The signed total domination number of graphs. (Q2881241)

Let \(G=(V,E)\) be a simple graph. For any real-valued function \(f\:V\to \mathbb {R}\), the weight of \(f\) is \(f(V)=\sum f(v)\), taken over all vertices \(v\in V\). A signed total dominating function is a function \(f\:V\to \{-1,1\}\) such that \(f(N(v))\geq 1\) for every vertex \(v\in V\), where \(N(v)\) is the open neighborhood of \(v\). The signed total domination number of a graph \(G\) equals the minimum weight of a signed total dominating function on \(G\). The authors prove that all graphs \(G\) of order \(n\) with minimum degree \(r\) have the signed total domination number \(O(n/\sqrt {r})\).