Add to ORKGLet k be a positive integer and G = (V, E) be a graph. A vertex subset D of a graph G is called 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, a sharp bound for γkp (T) is obtained where T is a tree
Let p be a positive integer and G = (V (G), E(G)) a graph. A p-dominating set of G is a subset S of ...
summary:Let $G$ be a graph with vertex set $V(G)$, and let $k\ge 1$ be an integer. A subset $D \subs...
Let G = (V(G),E(G)) be a simple graph, and let k be a positive integer. A subset D of V(G) is a k-do...
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...
Let k be a positive integer. A vertex subset D of a graph G = (V, E) is a perfect k-dominating set o...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to...
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...
Abstract: A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is a...
A k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex ...
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a ...
[[abstract]]A perfect edge dominating set of G=(V,E) is a subset D of E such that every edge not in ...
Abstract. Given a graph G, a set D ⊂ V (G) is a dominating set of G if every vertex not in D is adja...
Let p be a positive integer and G = (V (G), E(G)) a graph. A p-dominating set of G is a subset S of ...
summary:Let $G$ be a graph with vertex set $V(G)$, and let $k\ge 1$ be an integer. A subset $D \subs...
Let G = (V(G),E(G)) be a simple graph, and let k be a positive integer. A subset D of V(G) is a k-do...
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...
Let k be a positive integer. A vertex subset D of a graph G = (V, E) is a perfect k-dominating set o...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to...
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...
Abstract: A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is a...
A k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex ...
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a ...
[[abstract]]A perfect edge dominating set of G=(V,E) is a subset D of E such that every edge not in ...
Abstract. Given a graph G, a set D ⊂ V (G) is a dominating set of G if every vertex not in D is adja...
Let p be a positive integer and G = (V (G), E(G)) a graph. A p-dominating set of G is a subset S of ...
summary:Let $G$ be a graph with vertex set $V(G)$, and let $k\ge 1$ be an integer. A subset $D \subs...
Let G = (V(G),E(G)) be a simple graph, and let k be a positive integer. A subset D of V(G) is a k-do...