TY - JOUR
ID - 13575
TI - Twin minus domination in directed graphs
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Atapour, Maryam
AU - Khodkar, Abdollah
AD - Department of Mathematics
Faculty of basic sciences
University of Bonab
Bonab, Iran, Po. Box: 5551761167
AD - Department of Mathematics
University of West Georgia
Carrollton, GA 30118, USA
Y1 - 2016
PY - 2016
VL - 1
IS - 2
SP - 149
EP - 164
KW - twin domination in digraphs
KW - minus domination in graphs
KW - twin minus domination in digraphs
DO - 10.22049/cco.2016.13575
N2 - Let $D=(V,A)$ be a finite simple directed graph. A function $f:Vlongrightarrow {-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 $vin 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.
UR - http://comb-opt.azaruniv.ac.ir/article_13575.html
L1 - http://comb-opt.azaruniv.ac.ir/article_13575_b0af46e588dfc0fa0951f816023dd6df.pdf
ER -