Tyt. z nagłówka.Bibliogr. s. 158.A total outer-independent dominating set of a graph G = (V (G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G)Dostępny również w formie drukowanej.KEYWORDS: total outer-independent domination, total domination, tree
Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $...
Let G = (V,E) be a bipartite graph with partite sets X and Y. Two vertices of X are X-adjacent if th...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of ...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
Abstract. A total outer-independent dominating set of a graph G = (V (G), E(G)) is a set D of vertic...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
Let G = (V; E) be a graph. Set D V (G) is a total outer-connected dominating set of G if D is a tot...
Let G = (V,E) be a graph. Set D ⊆ V(G) is a total outer-connected dominating set of G if D is a tota...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
On the ratio between 2-domination and total outer-independent domination numbers of trees Marcin KRZ...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
For a graphG = (V,E), a subsetD ⊆ V (G) is a 2-dominating set if every vertex of V (G)\D has at leas...
Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $...
Let G = (V,E) be a bipartite graph with partite sets X and Y. Two vertices of X are X-adjacent if th...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of ...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
Abstract. A total outer-independent dominating set of a graph G = (V (G), E(G)) is a set D of vertic...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
Let G = (V; E) be a graph. Set D V (G) is a total outer-connected dominating set of G if D is a tot...
Let G = (V,E) be a graph. Set D ⊆ V(G) is a total outer-connected dominating set of G if D is a tota...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
On the ratio between 2-domination and total outer-independent domination numbers of trees Marcin KRZ...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
For a graphG = (V,E), a subsetD ⊆ V (G) is a 2-dominating set if every vertex of V (G)\D has at leas...
Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $...
Let G = (V,E) be a bipartite graph with partite sets X and Y. Two vertices of X are X-adjacent if th...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
DOI
Add to ORKG