@article {
author = {Dehgardi, N.},
title = {The minus k-domination numbers in graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {1},
number = {1},
pages = {15-28},
year = {2016},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2016.13534},
abstract = {For any integer $k\ge 1$, a minus $k$-dominating function is a function $f : V \rightarrow \{-1,0, 1\}$ satisfying $\sum_{w\in N[v]} f(w)\ge k$ for every $v\in V(G)$, where $N(v) =\{u \in V(G)\mid uv\in E(G)\}$ and $N[v] =N(v)\cup \{v\}$. The minimum of the values of $\sum_{v\in V(G)}f(v)$, taken over all minus $k$-dominating functions $f$, is called the minus $k$-domination number and is denoted by $\gamma^-_{k}(G)$. In this paper, we introduce the study of minus $k$-domination in graphs and present several sharp lower bounds on the minus $k$-domination number for general graphs.},
keywords = {Minus $k$-dominating function,minus $k$-domination number,graph},
url = {http://comb-opt.azaruniv.ac.ir/article_13534.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13534_842d7e5cc29617870d3b17a192a370e4.pdf}
}