Bounds On The Disjunctive Total Domination Number Of A Tree
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G). A set S of vertices in G is a disjunctive total dominating set of G if every vertex is adjacent to a vert...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
University of Zielona Góra
2016-02-01
|
| Collection: | Discussiones Mathematicae Graph Theory |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.7151/dmgt.1854 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|