Add to ORKGAbstract: Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1, such a set is called a dominating set of G. The Smarandachely domination k-number γk(G) of G is the minimum cardinality of a Smarandachely dominating k-set of G. S is called weak domination set if deg(u) ≤ deg(v) for every pair of (u, v) ∈ V (G) − S. The minimum cardinality of a weak domination set S is called weak domination number and denoted by γw(G). In this paper we introduce the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number. We give some boundary of this new parameter an...
In a graph G = (V, E) a vertex is said to dominate itself and all its neighbors. A set D ⊆ V is...
Abstract: A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
Introducing the weak reinforcement number which is the minimum number of added edges to reduce the w...
Abstract: A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each ve...
AbstractThe reinforcement number of a graph is the smallest number of edges that have to be added to...
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 simple graph. A subset S of V (G) is a dominating set of G if, for any ver...
Let G=(V, E) be a graph and u, v is an element of V. Then, u strongly dominates u and v weakly domin...
The concept of triple connected graphs with real life application was introduced by considering the ...
Let G(V(G), E(G)) be a simple undirected graph. A dominating set of G is a subset D ? V(G) such that...
The concept of triple connected graphs with live application was introduced in by considering the av...
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly ...
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...
AbstractThe reinforcement number of a graph G is the minimum cardinality of a set of extra edges who...
In a graph G = (V, E) a vertex is said to dominate itself and all its neighbors. A set D ⊆ V is...
Abstract: A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
Introducing the weak reinforcement number which is the minimum number of added edges to reduce the w...
Abstract: A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each ve...
AbstractThe reinforcement number of a graph is the smallest number of edges that have to be added to...
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 simple graph. A subset S of V (G) is a dominating set of G if, for any ver...
Let G=(V, E) be a graph and u, v is an element of V. Then, u strongly dominates u and v weakly domin...
The concept of triple connected graphs with real life application was introduced by considering the ...
Let G(V(G), E(G)) be a simple undirected graph. A dominating set of G is a subset D ? V(G) such that...
The concept of triple connected graphs with live application was introduced in by considering the av...
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly ...
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...
AbstractThe reinforcement number of a graph G is the minimum cardinality of a set of extra edges who...
In a graph G = (V, E) a vertex is said to dominate itself and all its neighbors. A set D ⊆ V is...
Abstract: A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...