summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ and $\langle S\rangle $ contains at least one perfect matching. We characterize the set of vertices of a tree that are contained in all minimum paired-dominating sets of the tree
AbstractIn this paper, we study a generalization of the paired domination number. Let G=(V,E) be a g...
Tyt. z nagłówka.Bibliogr. s. 783.Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is ...
Tyt. z nagłówka.Bibliogr. s. 134-135.In this paper we continue the study of paired-domination in gra...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set of G if every vertex not in S is adjac...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adj...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
A paired dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these ...
AbstractLet G=(V,E) be a graph without isolated vertices. For a positive integer k, a set S⊆V is a k...
AbstractIn this paper, we study a generalization of the paired domination number. Let G=(V,E) be a g...
Tyt. z nagłówka.Bibliogr. s. 783.Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is ...
Tyt. z nagłówka.Bibliogr. s. 134-135.In this paper we continue the study of paired-domination in gra...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set of G if every vertex not in S is adjac...
AbstractA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adj...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
A paired dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these ...
AbstractLet G=(V,E) be a graph without isolated vertices. For a positive integer k, a set S⊆V is a k...
AbstractIn this paper, we study a generalization of the paired domination number. Let G=(V,E) be a g...
Tyt. z nagłówka.Bibliogr. s. 783.Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is ...
Tyt. z nagłówka.Bibliogr. s. 134-135.In this paper we continue the study of paired-domination in gra...
DOI
Add to ORKG