Chromatic and clique numbers of a class of perfect graphs

Let p be a prime number and n be a positive integer. The graph Gp(n) is a graph with vertex set [n] = f 1;2;:::;ng , in which there is an arc from u to v if and only if u v and p ∤ u+v. In this paper