Add to ORKGFor a graphG = (V,E), a subsetD ⊆ V (G) is a 2-dominating set if every vertex of V (G)\D has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V (G) \D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees with equal 2-domination and 2-outer-independent domination numbers. Key words: 2-domination; 2-outer-independent domination; tree. 1
Abstract. A set S of vertices in a graph G = (V, E) is a 2-dominating set if every vertex of V \ S i...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
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...
On the ratio between 2-domination and total outer-independent domination numbers of trees Marcin KRZ...
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertexof $G$ not in $S$ is adj...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V-S is dominated ...
Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominate...
Tyt. z nagł.References p. 435-436.A set S of vertices in a graph G = (V,E) is a 2-dominating set if ...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
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...
Tyt. z nagłówka.Bibliogr. s. 158.A total outer-independent dominating set of a graph G = (V (G),E(G)...
We initiate the study of outer-2-independent domination in graphs. An outer-2-independent dominating...
A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of ...
Let (G) and 2;2(G) denote the domination number and (2; 2)-domination number of a graph G, respecti...
Abstract. A set S of vertices in a graph G = (V, E) is a 2-dominating set if every vertex of V \ S i...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
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...
On the ratio between 2-domination and total outer-independent domination numbers of trees Marcin KRZ...
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertexof $G$ not in $S$ is adj...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V-S is dominated ...
Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominate...
Tyt. z nagł.References p. 435-436.A set S of vertices in a graph G = (V,E) is a 2-dominating set if ...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
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...
Tyt. z nagłówka.Bibliogr. s. 158.A total outer-independent dominating set of a graph G = (V (G),E(G)...
We initiate the study of outer-2-independent domination in graphs. An outer-2-independent dominating...
A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of ...
Let (G) and 2;2(G) denote the domination number and (2; 2)-domination number of a graph G, respecti...
Abstract. A set S of vertices in a graph G = (V, E) is a 2-dominating set if every vertex of V \ S i...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
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...