2-Fair Dominating Sets in Some Class of Graphs
T G Jayasree · International Journal of Advanced Trends in Computer Science and Engineering · 2019
is adjacent to exactly k vertices in D. The k -fair domination number γ kfd (D) of G is the minimum cardinality of a k -fair dominating set.In this article, we determine the k-fair domination number of some class of graphs for k = 2.