@article {
author = {Atapour, Maryam and Khodkar, Abdollah},
title = {Twin minus domination in directed graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {1},
number = {2},
pages = {149-164},
year = {2016},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2016.13575},
abstract = {Let $D=(V,A)$ be a finite simple directed graph. A function $f:V\longrightarrow \{-1,0,1\}$ is called a twin minus dominating function if $f(N^-[v])\ge 1$ and $f(N^+[v])\ge 1$ for each vertex $v\in V$. The twin minus domination number of $D$ is $\gamma_{-}^*(D)=\min\{w(f)\mid f \mbox{ is a twin minus dominating function of } D\}$. In this paper, we initiate the study of twin minus domination numbers in digraphs and present some lower bounds for $\gamma_{-}^*(D)$ in terms of the order, size and maximum and minimum in-degrees and out-degrees.},
keywords = {twin domination in digraphs,minus domination in graphs,twin minus domination in digraphs},
url = {http://comb-opt.azaruniv.ac.ir/article_13575.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13575_b0af46e588dfc0fa0951f816023dd6df.pdf}
}