Add to ORKGLet G=(V, E) be a graph and u, v is an element of V. Then, u strongly dominates u and v weakly dominates a if(i) uv is an element of E and (ii) deg u greater than or equal to deg v. A set D subset of V is a strong-dominating set (sd-set) of G if every vertex in V-D is strongly dominated by at least one vertex in D. Similarly, a weak-dominating set (wd-set) is defined. The strong (weak) domination number gamma(s) (gamma(w)) of G is the minimum cardinality of an sd-set (wd-set). Besides investigating some relationship of gamma(s) and gamma(w) with other known parameters of G, some bounds are obtained. A graph G is domination balanced if there exists an sd-set D-1 and a wd-set D-2 such that D-1 boolean AND D-2={empty set}. A study of dominatio...
Let G = (V (G),E(G)) be a simple graph. A subset S of V (G) is a dominating set of G if, for any ver...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
Abstract: Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandach...
AbstractLet G = (V, E) be a graph and u, v ∈ V. Then, ustrongly dominates v and v weakly dominates u...
Let G = (V(G), E(G)) be a graph and uvεE. A subset D ⊆ V of vertices is a dominating set if every ve...
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly ...
In a graph G = (V, E) a vertex is said to dominate itself and all its neighbors. A set D ⊆ V is...
Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in...
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is domina...
AbstractLet G = (V, E) be a graph. A set D ⊆ V is a strong dominating set of G if for every vertex y...
AbstractLet G be a graph. Then μ(G)⩽|V(G)|−δ(G) where μ(G) denotes the weak or independent weak domi...
WOS: 000554629800013Let G = (V(G), E(G)) be a simple undirected graph of order vs and size m, and x,...
2-s2.0-85097108287Let G = (V(G)}E(G)) be a simple undirected graph of order n and size m, and x, y9 ...
Let G = (V, E) be a connected graph. A set D subset-of V is a set-dominating set (sd-set) if for eve...
summary:Let $G=(V_G,E_G)$ be a graph and let $N_G[v]$ denote the closed neighbourhood of a vertex $v...
Let G = (V (G),E(G)) be a simple graph. A subset S of V (G) is a dominating set of G if, for any ver...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
Abstract: Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandach...
AbstractLet G = (V, E) be a graph and u, v ∈ V. Then, ustrongly dominates v and v weakly dominates u...
Let G = (V(G), E(G)) be a graph and uvεE. A subset D ⊆ V of vertices is a dominating set if every ve...
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly ...
In a graph G = (V, E) a vertex is said to dominate itself and all its neighbors. A set D ⊆ V is...
Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in...
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is domina...
AbstractLet G = (V, E) be a graph. A set D ⊆ V is a strong dominating set of G if for every vertex y...
AbstractLet G be a graph. Then μ(G)⩽|V(G)|−δ(G) where μ(G) denotes the weak or independent weak domi...
WOS: 000554629800013Let G = (V(G), E(G)) be a simple undirected graph of order vs and size m, and x,...
2-s2.0-85097108287Let G = (V(G)}E(G)) be a simple undirected graph of order n and size m, and x, y9 ...
Let G = (V, E) be a connected graph. A set D subset-of V is a set-dominating set (sd-set) if for eve...
summary:Let $G=(V_G,E_G)$ be a graph and let $N_G[v]$ denote the closed neighbourhood of a vertex $v...
Let G = (V (G),E(G)) be a simple graph. A subset S of V (G) is a dominating set of G if, for any ver...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
Abstract: Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandach...