We prove that for every graph $G$ on $n$ vertices and with minimum degree five, the domination number $\gamma(G)$ cannot exceed $n/3$. The proof combines an algorithmic approach discharging method. Using same technique, we provide a shorter known upper bound $4n/11$ of graphs four.
