Add to ORKGA paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G. We give a constructive characterization of the trees with equal domination and paired-domination numbers
Tyt. z nagłówka.Bibliogr. s. 134-135.In this paper we continue the study of paired-domination in gra...
Abstract. Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is a paired-dominating set...
For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V - S is adjacent to at l...
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 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...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
Tyt. z nagłówka.Bibliogr. s. 783.Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is ...
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...
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these ...
Abstract. Let G be a graph with no isolated vertices. A set S of vertices in G is a total dominating...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
Tyt. z nagłówka.Bibliogr. s. 134-135.In this paper we continue the study of paired-domination in gra...
Abstract. Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is a paired-dominating set...
For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V - S is adjacent to at l...
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 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...
summary:A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ a...
Tyt. z nagłówka.Bibliogr. s. 783.Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is ...
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...
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these ...
Abstract. Let G be a graph with no isolated vertices. A set S of vertices in G is a total dominating...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
Tyt. z nagłówka.Bibliogr. s. 134-135.In this paper we continue the study of paired-domination in gra...
Abstract. Let G = (V,E) be a graph with no isolated vertices. A set S ⊆ V is a paired-dominating set...
For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V - S is adjacent to at l...