Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma \left(G\right)$, is the domination number of $G$. For $k\ge 1$, a $k$-fair dominating set ($kFD$-set) in $G$, is a dominating set $D$ such that $\left|N\right(v)\cap D|=k$ for every vertex $v\in V\setminus D$. A fair dominating set, in $G$ is a $kFD$-set for some integer $k\ge 1$. In this paper, after presenting preliminaries, we count the number of fair dominating sets of some specific graphs.