In this paper, we find the maximum exponent of primitive simple graphs G under the restriction $deg(v){geq}3$ for all vertex $v$ of G. Our result is also an answer of a Klee and Quaife type problem on exponent to find minimum number of vertices of graphs which have fixed even exponent and the degree of whose vertices are always at least 3.