Let be a graph. Let and be the domination and total domination number of a graph , respectively. The -criticality and -criticality of Harary graphs are studied. The Question of the paper [W. Goddard et al., The Diameter of total domination vertex critical graphs, Discrete Math. is fully answered with the family of Harary graphs. It is answered to the second part of Question of that paper with some Harary graphs.