Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On Graphs with Disjoint Dominating and 2-Dominating Sets

100%

Henning M. A., Rall D. F.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 1

139-146

A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only connected graph with minimum degree at least three for which D ∪ D2 necessarily contains all vertices of the graph.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Henning M. A.

1 Rall D. F.

1 2013

Wyniki wyszukiwania

On Graphs with Disjoint Dominating and 2-Dominating Sets