Twin Minus Total Domination Numbers In Directed Graphs
Let D = (V,A) be a finite simple directed graph (shortly, digraph). A function f : V → {−1, 0, 1} is called a twin minus total dominating function (TMTDF) if f(N−(v)) ≥ 1 and f(N+(v)) ≥ 1 for each vertex v ∈ V. The twin minus total domination number of D is y*<sub>mt</sub>(D) = min{w(f) | f is a TMT...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
University of Zielona Góra
2017-11-01
|
| Reeks: | Discussiones Mathematicae Graph Theory |
| Onderwerpen: | |
| Online toegang: | https://doi.org/10.7151/dmgt.1983 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|