Let R(d) be the graph of realizations of graphic degree sequence d . We prove if G and G’ are adjacent in R(d) , then |ω(G) - ω(G) ≤ 1. Together with the fact that the graph of realizations in connected , it follows that for any graphic degree sequence d , there exist integers a and b such that d has realization with clique number C if and only if C is an integer satisfying a ≤ c ≤ b. Again , for given a graphic degree sequence d , we defined min (ω ,d) and max (ω,d) to be min (ω ,d) = min { ω (d)G є R(d)} max (ω ,d) = max { ω (d)G є R(d)} By using known facts on the following theorem . we are able to find min (ω ,d) and max (ω ,d) for all regular degree sequence d .