On fair domination of special graphs.

"In Graph theory, the study of domination is one of the fastest growing area in recent years. There are different types of domination such as connected domination, independent domination, total domination, paired domination, secure domination, fair domination, fair secure domination etc., A Fair dominating set (FD-set) in a graph G is a dominating set S such that all vertices in V-S are dominated by the equal number of vertices in S. The minimum cardinality of a Fair dominating set is the fair domination number and is denoted by γfd(G). In this paper we discuss in finding the fair domination number for some special graphs." [ABSTRACT FROM AUTHOR]