Signed Domination Number of the Directed Cylinder

In a digraph D = ( V ( D ) , A ( D ) ) , a two-valued function f : V ( D ) → { − 1 , 1 } defined on the vertices of D is called a signed dominating function if f ( N − [ v ] ) ≥ 1 for every v in D. The weight of a signed dominating function is f ( V ( D ) ) = ∑ v ∈ V ( D ) f ( v ) . The signed domination number γ s ( D ) is the minimum weight among all signed dominating functions of D. Let P m × C n be the Cartesian product of directed path P m and directed cycle C n . In this paper, the exact value of γ s ( P m × C n ) is determined for any positive integers m and n.

[1]  Zoltán Füredi,et al.  Signed Domination in Regular Graphs and Set-Systems , 1999, J. Comb. Theory, Ser. B.

[2]  Xing Chen,et al.  On domination number of Cartesian product of directed cycles , 2010, Inf. Process. Lett..

[3]  R. B. Patel,et al.  Capacity and interference aware link scheduling with channel assignment in wireless mesh networks , 2011, J. Netw. Comput. Appl..

[4]  Lutz Volkmann.  Signed domination and signed domatic numbers of digraphs , 2011, Discuss. Math. Graph Theory.

[5]  Michael A. Henning.  Signed total domination in graphs , 2004, Discret. Math..

[6]  Jixiang Meng,et al.  On domination number of Cartesian product of directed paths , 2011, J. Comb. Optim..

[7]  Juan A. Rodríguez-Velázquez,et al.  Total Weak Roman Domination in Graphs , 2019, Symmetry.

[8]  Seyed Mahmoud Sheikholeslami,et al.  Lower bounds on the signed domination numbers of directed graphs , 2009, Discret. Math..

[9]  Weidong Chen,et al.  Lower bounds on several versions of signed domination number , 2008, Discret. Math..

[10]  Sounaka Mishra,et al.  Complexity of majority monopoly and signed domination problems , 2012, J. Discrete Algorithms.

[11]  Michel Mollard.  On the Domination of Cartesian Product of Directed Cycles: Results for Certain Equivalence Classes of Lengths , 2013, Discuss. Math. Graph Theory.

[12]  Odile Favaron,et al.  Signed domination in regular graphs , 1996, Discret. Math..

[13]  T. C. E. Cheng,et al.  An application of the Turán theorem to domination in graphs , 2008, Discret. Appl. Math..

[14]  Jirí Matousek.  On the Signed Domination in Graphs , 2000, Comb..

[15]  Michel Mollard,et al.  The domination number of Cartesian product of two directed paths , 2014, J. Comb. Optim..

[16]  Juan A. Rodríguez-Velázquez,et al.  On the Secure Total Domination Number of Graphs , 2019, Symmetry.

[17]  Bohdan Zelinka.  Signed domination numbers of directed graphs , 2005 .

[18]  T. C. Edwin Cheng,et al.  Remarks on the minus (signed) total domination in graphs , 2008, Discret. Math..

[19]  LOWER BOUNDS OF SIGNED DOMINATION NUMBER OF A GRAPH , 2004 .

[20]  Xing Chen,et al.  Domination number of Cartesian products of directed cycles , 2010, Inf. Process. Lett..