Add to ORKGCopyright c © 2013 K. A. Germina and P. K. Ashraf. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A graph whose edges are labeled either as positive or negative is called a signed graph. Motivated from the seminal paper of B. D. Acharya on domination in signed graphs, we in this article, provide answers to some of the problems in that paper and define open domi-nation for a signed graph and its open domination number. We analyze this notion for certain classes of signed graphs and also give exact val-ues for their open domination numbers. We also discuss about certain bounds ...
AbstractLet G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colour...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
summary:The signed total domination number of a graph is a certain variant of the domination number....
A signed graph Σ is a graph with positive or negative signs attatched to each of its edges. A signed...
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
Let G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for ev...
AbstractFor a graph G, a signed domination function of G is a two-colouring of the vertices of G wit...
summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar...
In this paper, we study the inverse signed total domination number in graphs and present new sharp l...
A graph with either positive or negative labels on the edge becomes a signed graph. Given a signed g...
<p>A nonnegative signed dominating function (NNSDF) of a graph $G$<br />is a function $f$ from the v...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
AbstractLet G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colour...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a prod...
summary:The signed total domination number of a graph is a certain variant of the domination number....
A signed graph Σ is a graph with positive or negative signs attatched to each of its edges. A signed...
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
Let G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for ev...
AbstractFor a graph G, a signed domination function of G is a two-colouring of the vertices of G wit...
summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar...
In this paper, we study the inverse signed total domination number in graphs and present new sharp l...
A graph with either positive or negative labels on the edge becomes a signed graph. Given a signed g...
<p>A nonnegative signed dominating function (NNSDF) of a graph $G$<br />is a function $f$ from the v...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
AbstractLet G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colour...