Super Fair Dominating Set in Graphs
Enrico L. Enriquez · Journal of Global Research in Mathematical Archives(JGRMA) · 2019
In this paper, we initiate the study of super fair dominating set of a graph by giving the super fair domination number of some special graphs. Further, we shows that given positive integers k,m, and n such that n\geq 2 and 1\leq k\leq m\leq n-1 there exists a connected graph G with |V(G)|=k, \gamma_{fd}(G)=k, and \gamma_{sfd}=m. Finally, we characterize the super fair dominating set of the join of two graphs.