- Tytuł:
- Fair Domination Number in Cactus Graphs
- Autorzy:
-
Hajian, Majid
Rad, Nader Jafari - Powiązania:
- https://bibliotekanauki.pl/articles/31343422.pdf
- Data publikacji:
- 2019-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
fair domination
cactus graph
unicyclic graph - Opis:
- For k ≥ 1, a k-fair dominating set (or just kFD-set) in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V \ S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set. A fair dominating set, abbreviated FD-set, is a kFD-set for some integer k ≥ 1. The fair domination number, denoted by fd(G), of G that is not the empty graph, is the minimum cardinality of an FD-set in G. In this paper, aiming to provide a particular answer to a problem posed in [Y. Caro, A. Hansberg and M.A. Henning, Fair domination in graphs, Discrete Math. 312 (2012) 2905–2914], we present a new upper bound for the fair domination number of a cactus graph, and characterize all cactus graphs G achieving equality in the upper bound of fd1(G).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 489-503
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł