AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has at least one neighbor in D. The domination number γ(G) is the smallest number of vertices in any dominating set. In this paper, a characterization is given for block graphs having a unique minimum dominating set. With this result, we generalize a theorem of Gunther, Hartnell, Markus and Rall for trees
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
A set S of vertices of a graph G is a total dominating set if every vertex of V(G) is adjacent to so...
A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G a...
International audienceA dominating set is a set S of vertices in a graph such that every vertex not ...
International audienceA dominating set is a set S of vertices in a graph such that every vertex not ...
For any graph = , , block graph is a graph whose set of vertices is the union of the set o...
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
A set S of vertices of a graph G is a total dominating set if every vertex of V(G) is adjacent to so...
A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G a...
International audienceA dominating set is a set S of vertices in a graph such that every vertex not ...
International audienceA dominating set is a set S of vertices in a graph such that every vertex not ...
For any graph = , , block graph is a graph whose set of vertices is the union of the set o...
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are ...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
Let G be a graph with vertex set V. A subset S ? V is a semipaired dominating set of G if every vert...
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a pe...
DOI
Add to ORKG