Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function is called a signed dominating function (SDF) iffor each vertex v. The weight w(f ) of f is defined by. The signed domination number of a digraph D is gs(D) = min{w(f ) : f is an SDF of D}. Let Cmn denotes the Cartesian product of directed cycles of length m and n. In this paper, we determine the exact value of signed domination number of some classes of Cartesian product of directed cycles. In particular, we prove that: (a) gs(C3n) = n if n 0(mod 3), otherwise gs(C3n) = n + 2. (b) gs(C4n) = 2n. (c) gs(C5n) = 2n if n 0(mod 10), gs(C5n) = 2n + 1 if n 3, 5, 7(mod 10), gs(C5n) = 2n + 2 if n 2, 4, 6, 8(mod 10), gs(C5n) = 2n + 3 if n 1,9(mod 10). (d) gs(C6n)...
Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → {-1,1} be a two-valu...
AbstractLet γ(G) be the domination number of a graph G and let G □ H denote the Cartesian product of...
AbstractLet G be a graph with vertex set V(G) and edge set E(G). A function f:E(G)→{-1,1} is said to...
Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function ( ) {}−: ...
Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A...
Denote by γ(G) the domination number of a digraph G and Cm□Cn the Cartesian product of Cm and Cn, th...
Let $G$ be a finite connected simple graph with a vertex set $V(G)$ and an edge set $E(G)$. A total ...
Let γ ( D ) denote the domination number of a digraph D and let C m □ C n d...
Let γ(D) denote the domination number of a digraph D and let C$_m$□C$_n$ denote the Cartesian produc...
Let γ(D) denote the domination number of a digraph D and let C$_m$□C$_n$ denote the Cartesian produc...
AbstractLet γ(G) denote the domination number of a graph G and let Cn□G denote the cartesian product...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
Let D be a finite and simple digraph with the vertex set V (D), and let f: V (D) → {−1, 1} be a two-...
Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → {-1,1} be a two-valu...
AbstractLet γ(G) be the domination number of a graph G and let G □ H denote the Cartesian product of...
AbstractLet G be a graph with vertex set V(G) and edge set E(G). A function f:E(G)→{-1,1} is said to...
Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function ( ) {}−: ...
Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A...
Denote by γ(G) the domination number of a digraph G and Cm□Cn the Cartesian product of Cm and Cn, th...
Let $G$ be a finite connected simple graph with a vertex set $V(G)$ and an edge set $E(G)$. A total ...
Let γ ( D ) denote the domination number of a digraph D and let C m □ C n d...
Let γ(D) denote the domination number of a digraph D and let C$_m$□C$_n$ denote the Cartesian produc...
Let γ(D) denote the domination number of a digraph D and let C$_m$□C$_n$ denote the Cartesian produc...
AbstractLet γ(G) denote the domination number of a graph G and let Cn□G denote the cartesian product...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
Let D be a finite and simple digraph with the vertex set V (D), and let f: V (D) → {−1, 1} be a two-...
Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → {-1,1} be a two-valu...
AbstractLet γ(G) be the domination number of a graph G and let G □ H denote the Cartesian product of...
AbstractLet G be a graph with vertex set V(G) and edge set E(G). A function f:E(G)→{-1,1} is said to...