A note on the fair domination number in outerplanar graphs

Majid Hajian | Nader Jafari Rad

---

URL :   http://research.shahed.ac.ir/WSR/WebPages/Report/PaperView.aspx?PaperID=85634
Date :  2018/10/14
Publish in :    Discussiones Mathematicae Graph Theory
DOI :  https://doi.org/10.7151/dmgt.2157
Link :  https://www.dmgt.uz.zgora.pl/publish/view_press.php?ID=-53378
Keywords :NOTE, FAIR, DOMINATION

Abstract :

---

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, we present a new sharp upper bound for the fair domination number of an outerplanar graph.