On independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an independent dominating set of a digraph $D$ if $S$ is both an independent and a dominating set of $D$. The independent domination number $i(D)$ is the minimum cardinality of an independent dominating set of $D$. In this paper we calculate the independent domi...
Main Author: | R. Shaheen |
---|---|
Format: | Article |
Language: | English |
Published: |
Azarbaijan Shahide Madani University
2019-06-01
|
Series: | Communications in Combinatorics and Optimization |
Subjects: | |
Online Access: | http://comb-opt.azaruniv.ac.ir/article_13846_0948ec1c34ebfc23d9e6b9f6dc3f735d.pdf |
Similar Items
-
More Results on the Domination Number of Cartesian Product of Two Directed Cycles
by: Ansheng Ye, et al.
Published: (2019-02-01) -
Domination Numbers of Complete Grid Graph Pk × Pn
by: Mahmoud Saoud
Published: (2012-05-01) -
On the Domination of Cartesian Product of Directed Cycles: Results for Certain Equivalence Classes of Lengths
by: Mollard Michel
Published: (2013-05-01) -
On the super domination number of graphs
by: Douglas J. Klein, et al.
Published: (2020-12-01) -
The geodetic domination number for the product of graphs
by: S. Robinson Chellathurai, et al.
Published: (2014-12-01)