summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments. It is proved that for digraphs with a directed Hamiltonian cycle the signed domination number may be arbitrarily small
AbstractLet G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that...
AbstractLet G be a finite and simple graph with the vertex set V(G), and let f:V(G)→{−1,1} be a two-...
summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simp...
summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar...
summary:The signed total domination number of a graph is a certain variant of the domination number....
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
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 function is called ...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
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...
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 G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for ev...
<p>A nonnegative signed dominating function (NNSDF) of a graph $G$<br />is a function $f$ from the v...
AbstractFor a graph G, a signed domination function of G is a two-colouring of the vertices of G wit...
Copyright c © 2013 K. A. Germina and P. K. Ashraf. This is an open access article distributed under ...
AbstractLet G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that...
AbstractLet G be a finite and simple graph with the vertex set V(G), and let f:V(G)→{−1,1} be a two-...
summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simp...
summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar...
summary:The signed total domination number of a graph is a certain variant of the domination number....
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
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 function is called ...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
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...
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 G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for ev...
<p>A nonnegative signed dominating function (NNSDF) of a graph $G$<br />is a function $f$ from the v...
AbstractFor a graph G, a signed domination function of G is a two-colouring of the vertices of G wit...
Copyright c © 2013 K. A. Germina and P. K. Ashraf. This is an open access article distributed under ...
AbstractLet G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that...
AbstractLet G be a finite and simple graph with the vertex set V(G), and let f:V(G)→{−1,1} be a two-...
summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simp...
DOI
Add to ORKG