Add to ORKGAbstract: 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 number γk(G) of G is the minimum cardinality of a Smarandachely dominating set of G. For abbreviation, we denote γ1(G) by γ(G). In 1996, Reed proved that the domination number γ(G) of every n-vertex graph G with minimum degree at least 3 is at most 3n/8. Also, he conjectured that γ(H) ≥ ⌈n/3 ⌉ for every connected 3-regular n-vertex graph H. In [?], the authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination numb...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of...
Abstract: A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each ve...
AbstractLet G=(V,E) be a simple graph. A set D⊆V is a dominating set of G if every vertex of V−D is ...
The concept of triple connected graphs with live application was introduced in by considering the av...
The concept of triple connected graphs with real life application was introduced by considering the ...
AbstractIn 1996, Reed proved that the domination number γ(G) of every n-vertex graph G with minimum ...
AbstractLet G=(V,E) be a graph. A subset S of V is called a dominating set if each vertex of V−S has...
Abstract: Let G = (V,E) be a graph. A subset S of V is called a domi-nating set if each vertex of V ...
AbstractThe k-restricted domination number of a graph G is the smallest integer dk such that given a...
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V(G) is a double dominating ...
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of...
Abstract: A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each ve...
AbstractLet G=(V,E) be a simple graph. A set D⊆V is a dominating set of G if every vertex of V−D is ...
The concept of triple connected graphs with live application was introduced in by considering the av...
The concept of triple connected graphs with real life application was introduced by considering the ...
AbstractIn 1996, Reed proved that the domination number γ(G) of every n-vertex graph G with minimum ...
AbstractLet G=(V,E) be a graph. A subset S of V is called a dominating set if each vertex of V−S has...
Abstract: Let G = (V,E) be a graph. A subset S of V is called a domi-nating set if each vertex of V ...
AbstractThe k-restricted domination number of a graph G is the smallest integer dk such that given a...
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V(G) is a double dominating ...
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...