Twin minus domination numbers in directed graphs
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 \mbo...
Main Authors: | M. Atapour, A. Khodkar |
---|---|
Format: | Article |
Language: | English |
Published: |
Azarbaijan Shahide Madani University
2016-06-01
|
Series: | Communications in Combinatorics and Optimization |
Subjects: | |
Online Access: | http://comb-opt.azaruniv.ac.ir/article_13575.html |
Similar Items
-
Twin Minus Total Domination Numbers In Directed Graphs
by: Dehgardi Nasrin, et al.
Published: (2017-11-01) -
Global minus domination in graphs
by: Maryam Atapour, et al.
Published: (2014-06-01) -
The minus $k$-domination numbers in graphs
by: N. Dehgardi
Published: (2016-01-01) -
Characterization of signed paths and cycles admitting minus dominating function
by: S.R. Shreyas, et al.
Published: (2020-06-01) -
Domination in Fuzzy Directed Graphs
by: Enrico Enriquez, et al.
Published: (2021-09-01)