DOIAbstract
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some vertex in D. In this paper, we provide a constructive characterization of trees with unique minimum dominating set
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some vertex in D. In this paper, we provide a constructive characterization of trees with unique minimum dominating set
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...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
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 of a graph G is a total dominating set if every vertex of V (G) is adjacent to s...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
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...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
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 and no isolated vertices. A subset S ⊆ V is a semipaired dominati...
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...
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...
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...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
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 of a graph G is a total dominating set if every vertex of V (G) is adjacent to s...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
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...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
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 and no isolated vertices. A subset S ⊆ V is a semipaired dominati...
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...
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...
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...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
Add to ORKG