Add to ORKGA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. The total domination number, yt(G), of G is the minimum cardinality of a total dominating set of G. A set S of vertices in G is a disjunctive dominating set in G if every vertex not in S is adjacent to a vertex of S or has at least two vertices in S at distance 2 from it in G. The disjunctive domination number, yd2 (G), of G is the minimum cardinality of a disjunctive dominating set in G. By denition, we have yd2 (T) ≤ yt(T). In this paper, we provide a constructive characterization of the trees T achieving equality in this bound.Keywords: Domination, disjunctive domination, tree
AbstractA subset S of V is called a total dominating set if every vertex in V 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 s...
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 dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
A set S of vertices of a graph G is a disjunctive dominating set if for every v 2 V (G) n S, v is ad...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation o...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some ...
A total edge dominating set of a graph G is a set D of edges of G such that the sub graph D has no i...
For a positive integer b, we define a set S of vertices in a graph G as a b-disjunctive dominating s...
A set S of vertices of a graph G is a total dominating set if every vertex of V(G) is adjacent to so...
For a set S ⊆ V (G), if every vertex has a neighbor in S or has at least two vertices in S at distan...
A set D of vertices in a graph G is a disjunctive dominating set in G if every vertex not in D is ad...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
AbstractA subset S of V is called a total dominating set if every vertex in V 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 s...
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 dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
A set S of vertices of a graph G is a disjunctive dominating set if for every v 2 V (G) n S, v is ad...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation o...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some ...
A total edge dominating set of a graph G is a set D of edges of G such that the sub graph D has no i...
For a positive integer b, we define a set S of vertices in a graph G as a b-disjunctive dominating s...
A set S of vertices of a graph G is a total dominating set if every vertex of V(G) is adjacent to so...
For a set S ⊆ V (G), if every vertex has a neighbor in S or has at least two vertices in S at distan...
A set D of vertices in a graph G is a disjunctive dominating set in G if every vertex not in D is ad...
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at l...
AbstractA subset S of V is called a total dominating set if every vertex in V 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 s...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...