Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree

100%

Henning M. A., Marcon A. J.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 1

71-93

Let G be a graph with no isolated vertex. In this paper, we study a parameter that is squeezed between arguably the two most important domination parameters; namely, the domination number, γ(G), and the total domination number, γt(G). A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. The semitotal domination number, γt2(G), is the minimum cardinality of a semitotal dominating set of G. We observe that γ(G) ≤ γt2(G) ≤ γt(G). We characterize the set of vertices that are contained in all, or in no minimum semitotal dominating set of a tree.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Henning M. A.

1 Marcon A. J.

1 2016

Wyniki wyszukiwania

Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree