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 adjacent to a vertex of D. The domination number of G, denoted by γ(G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then γ(G)≤6n17
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set if every vertex of V−S is adjacent to ...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
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 ...
Abstract: A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
For distinct vertices u and ν of a nontrivial connected graph G, the detour distance D(u, ν) between...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
AbstractFor a graph G, let σk(G) be the minimum degree sum of an independent set of k vertices. Ore ...
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 S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is a...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set if every vertex of V−S is adjacent to ...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
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 ...
Abstract: A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
For distinct vertices u and ν of a nontrivial connected graph G, the detour distance D(u, ν) between...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
AbstractFor a graph G, let σk(G) be the minimum degree sum of an independent set of k vertices. Ore ...
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 S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is a...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set if every vertex of V−S is adjacent to ...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
DOI
Add to ORKG