On the minus domination number of graphs
Hailong Liu, Liang Sun (2004)
Czechoslovak Mathematical Journal
Similarity:
Let be a simple graph. A -valued function is said to be a minus dominating function if for every vertex , , where is the closed neighborhood of . The weight of a minus dominating function on is . The minus domination number of a graph , denoted by , equals the minimum weight of a minus dominating function on . In this paper, the following two results are obtained. (1) If is a bipartite graph of order , then (2) For any negative integer and any positive integer...