- Tytuł:
- Fair Total Domination Number in Cactus Graphs
- Autorzy:
-
Hajian, Majid
Rad, Nader Jafari - Powiązania:
- https://bibliotekanauki.pl/articles/32083904.pdf
- Data publikacji:
- 2021-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
fair total domination
cactus graph - Opis:
- For k ≥ 1, a k-fair total dominating set (or just kFTD-set) in a graph G is a total dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V\S. The k-fair total domination number of G, denoted by ftdk(G), is the minimum cardinality of a kFTD-set. A fair total dominating set, abbreviated FTD-set, is a kFTD-set for some integer k ≥ 1. The fair total domination number of a nonempty graph G, denoted by ftd(G), of G is the minimum cardinality of an FTD-set in G. In this paper, we present upper bounds for the 1-fair total domination number of cactus graphs, and characterize cactus graphs achieving equality for the upper bounds.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 647-664
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł