A subset S of a vertex set of a graph is called a dominating set if every vertex of the graph is either an element of S or is adjacent to an element of S. The domination number of a graph is the minimum cardinality among the dominating sets of that graph. In this note we study the domination numbers, the forcing domination numbers, the independent domination numbers and the total domination numbers for Harary graphs.
