The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Relationships between distance domination parameters.”

Distance in graphs

Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)

Czechoslovak Mathematical Journal

Similarity:

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

Michael A. Henning, Alister J. Marcon (2016)

Discussiones Mathematicae Graph Theory

Similarity:

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...