Add to ORKGA recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, Ars Comb. 89 (2008), 159{162) implies that every connected graph of minimum degree at least three has a dominating set D and a total dominating set T which are disjoint. We show that the Petersen graph is the only such graph for which D [ T necessarily contains all vertices of the graph
We consider the problem of finding k disjoint dominating sets with a minimum size of their union, in...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
AbstractIn this paper, we continue the study of total restrained domination in graphs, a concept int...
A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominati...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
A subset D ⊆ VG is a dominating set of G if every vertex in VG – D has a neighbor in D, while D is a...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
Abstract: A total dominating set of a graph G is a set of the vertex set V of G such that every vert...
Abstract. Total domination number of a graph without isolated vertex is the minimum cardinality of a...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractA total dominating set of a graph is a set of vertices such that every vertex is adjacent to...
We consider the problem of finding k disjoint dominating sets with a minimum size of their union, in...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
AbstractIn this paper, we continue the study of total restrained domination in graphs, a concept int...
A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominati...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
A subset D ⊆ VG is a dominating set of G if every vertex in VG – D has a neighbor in D, while D is a...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
Abstract: A total dominating set of a graph G is a set of the vertex set V of G such that every vert...
Abstract. Total domination number of a graph without isolated vertex is the minimum cardinality of a...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
AbstractA total dominating set of a graph is a set of vertices such that every vertex is adjacent to...
We consider the problem of finding k disjoint dominating sets with a minimum size of their union, in...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
AbstractIn this paper, we continue the study of total restrained domination in graphs, a concept int...