Add to ORKGTyt. z nagł.References p. 435-436.A set S of vertices in a graph G = (V,E) is a 2-dominating set if every vertex of VDostępny również w formie drukowanej.KEYWORDS: 2-dominating set, 2-domination number, 2-domination subdivision number
Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, res...
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertexof $G$ not in $S$ is adj...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
Abstract. A set S of vertices in a graph G = (V, E) is a 2-dominating set if every vertex of V \ S i...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
For a graphG = (V,E), a subsetD ⊆ V (G) is a 2-dominating set if every vertex of V (G)\D has at leas...
A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\se...
AbstractIn a graph G, a vertex dominates itself and its neighbors. A subset S⊆V(G) is a double domin...
AbstractA set S of vertices of a graph G=(V,E) is a dominating set if every vertex of V(G)∖S is adja...
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...
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 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) and 2;2(G) denote the domination number and (2; 2)-domination number of a graph G, respecti...
Abstract: Let $$G=(V,E)$$ be a simple graph. A set $$D\subseteq V$$ is a $$2$$-dominating set of $$G...
On the ratio between 2-domination and total outer-independent domination numbers of trees Marcin KRZ...
Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, res...
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertexof $G$ not in $S$ is adj...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
Abstract. A set S of vertices in a graph G = (V, E) is a 2-dominating set if every vertex of V \ S i...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
For a graphG = (V,E), a subsetD ⊆ V (G) is a 2-dominating set if every vertex of V (G)\D has at leas...
A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\se...
AbstractIn a graph G, a vertex dominates itself and its neighbors. A subset S⊆V(G) is a double domin...
AbstractA set S of vertices of a graph G=(V,E) is a dominating set if every vertex of V(G)∖S is adja...
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...
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 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) and 2;2(G) denote the domination number and (2; 2)-domination number of a graph G, respecti...
Abstract: Let $$G=(V,E)$$ be a simple graph. A set $$D\subseteq V$$ is a $$2$$-dominating set of $$G...
On the ratio between 2-domination and total outer-independent domination numbers of trees Marcin KRZ...
Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, res...
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertexof $G$ not in $S$ is adj...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...