Add to ORKGLet k be a positive integer. A vertex subset D of a graph G = (V, E) is a perfect k-dominating set of G if every vertex v of G, not in D, is adjacent to exactly k vertices of D. The minimum cardinality of a perfect k-dominating set of G is the perfect k-domination number γkp(G). In this paper, we generalize perfect domination to perfect k-domination, where many bounds ofγkp(G) are obtained. We prove that the perfect k-domination problem is NP-complete for general graphs
For a graph G a subset D of the vertex set of G is a k-dominating set if every vertex not in D has a...
[[abstract]]A perfect edge dominating set of G=(V,E) is a subset D of E such that every edge not in ...
Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the...
Let k be a positive integer and G=(V,E) be a graph. A vertex subset D of a graph G is called a perfe...
Let k be a positive integer and G = (V, E) be a graph. A vertex subset D of a graph G is called a pe...
Let \(k\) be a positive integer and \(G = (V;E)\) be a graph. A vertex subset \(D\) of a graph \(G\)...
Let k be a positive integer and G=(V,E) be a graph. A vertex subset D of a graph G is called a perfe...
Let k be a positive integer and G = (V,E) be a graph. A vertex subset D of a graph G is called a per...
Abstract. Given a graph G, a set D ⊂ V (G) is a dominating set of G if every vertex not in D is adja...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to...
AbstractLet G = (V, E) be a graph and let S ⊆ V.. The set S is a dominating set of G is every vertex...
Abstract: A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is a...
Let kk be a positive integer and let GG be a graph with vertex set V(G)V(G). A subset D⊆V(G)D\subset...
Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the...
Abstract: A variety of terminology has been used in the literature to describe a dominating set with...
For a graph G a subset D of the vertex set of G is a k-dominating set if every vertex not in D has a...
[[abstract]]A perfect edge dominating set of G=(V,E) is a subset D of E such that every edge not in ...
Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the...
Let k be a positive integer and G=(V,E) be a graph. A vertex subset D of a graph G is called a perfe...
Let k be a positive integer and G = (V, E) be a graph. A vertex subset D of a graph G is called a pe...
Let \(k\) be a positive integer and \(G = (V;E)\) be a graph. A vertex subset \(D\) of a graph \(G\)...
Let k be a positive integer and G=(V,E) be a graph. A vertex subset D of a graph G is called a perfe...
Let k be a positive integer and G = (V,E) be a graph. A vertex subset D of a graph G is called a per...
Abstract. Given a graph G, a set D ⊂ V (G) is a dominating set of G if every vertex not in D is adja...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to...
AbstractLet G = (V, E) be a graph and let S ⊆ V.. The set S is a dominating set of G is every vertex...
Abstract: A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is a...
Let kk be a positive integer and let GG be a graph with vertex set V(G)V(G). A subset D⊆V(G)D\subset...
Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the...
Abstract: A variety of terminology has been used in the literature to describe a dominating set with...
For a graph G a subset D of the vertex set of G is a k-dominating set if every vertex not in D has a...
[[abstract]]A perfect edge dominating set of G=(V,E) is a subset D of E such that every edge not in ...
Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the...