Upper minus total domination in small-degree regular graphs (Q2455571)

A function \(f:V(G)\rightarrow \{-1,0,1\}\) defined on the vertices of a graph \(G\) is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. An MTDF \(f\) is minimal if there does not exist an MTDF \(g:V(G)\rightarrow \{-1,0,1\}\), \(g\neq f\) for which \(g(v)\leq f(v)\) for every \(v\in V(G).\) The weight of an MTDF is the sum of its function values over all vertices. The minus total domination number of \(G\) is the minimum weight of an MTDF on \(G\), while the upper minus domination number of \(G\) is the maximum weight of a minimal MTDF on \(G\). Upper bounds are provided on the upper minus total domination number of a cubic graph, and a 4-regular graph, and the regular graphs attaining these upper bounds are characterized.