… We attempt to classify graphs according to their minus domination numbers. For … graph with
minus domination number equal to n. Properties of the minus domination number of a graph …

… denoted T-(G), equals the maximum weight of a minimal minus dominating … graphs or
chordal graphs. We also present a linear time algorithm for finding a minimum minus dominating …

… Next we show that the minus total domination number of a triangle-free graph has the
above lower bound and we characterize the extremal graphs attaining this bound. …

… minus dominating function of G}. In this paper we initiate the study of the … minus domination
number in graphs and we establish lower and upper bounds for the global minus domination …

… some properties of minus total domination on a graph G and … some properties of minus total
domination on a graph G and obtain … restrict our attention to graphs without isolated vertices. …

… To show that this bound is tight, we present for any k⩾2 a connected graph of 7k vertices
and a minus dominating function with p−m=k. The graph consists of k copies of the following …

… the e cient minus domination problem is equivalent to the e cient domination problem on
trees. … For trees, we show that the e cient minus domination problem coincides with the e cient …

… in graph theory [31]. In this chapter we survey main results concerning minus and signed
domination of graphs. … For more variations on signed and minus domination, including studying …

… Now for any graph G in ¿s, we let f(v) = −1 if v ∈ X2 ∪Y2 and f(v)=1 if v ∈ X1∪Y1. Then f is
a minus dominating function on G. Thus γ−(G) ⩽ f(V (G)) = |X1| + |Y1|−|X2|−|Y2| = 4(√n + 1 − …

… minus domination number of a graph G, denoted −(G), equals the maximum weight of a
minimal minus dominating … In this paper, sharp upper bounds on − of regular graphs are found. …