Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree
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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1844 |
id |
doaj-0ab1ec90410442bc8663b8914b351135 |
---|---|
record_format |
Article |
spelling |
doaj-0ab1ec90410442bc8663b8914b3511352021-09-05T17:20:21ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922016-02-01361719310.7151/dmgt.1844dmgt.1844Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A TreeHenning Michael A.0Marcon Alister J.1Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South AfricaDepartment of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South AfricaLet 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.https://doi.org/10.7151/dmgt.1844dominationsemitotal dominationtrees05c69 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Henning Michael A. Marcon Alister J. |
spellingShingle |
Henning Michael A. Marcon Alister J. Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree Discussiones Mathematicae Graph Theory domination semitotal domination trees 05c69 |
author_facet |
Henning Michael A. Marcon Alister J. |
author_sort |
Henning Michael A. |
title |
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree |
title_short |
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree |
title_full |
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree |
title_fullStr |
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree |
title_full_unstemmed |
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree |
title_sort |
vertices contained in all or in no minimum semitotal dominating set of a tree |
publisher |
Sciendo |
series |
Discussiones Mathematicae Graph Theory |
issn |
2083-5892 |
publishDate |
2016-02-01 |
description |
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. |
topic |
domination semitotal domination trees 05c69 |
url |
https://doi.org/10.7151/dmgt.1844 |
work_keys_str_mv |
AT henningmichaela verticescontainedinallorinnominimumsemitotaldominatingsetofatree AT marconalisterj verticescontainedinallorinnominimumsemitotaldominatingsetofatree |
_version_ |
1717786472368570368 |