On Graph Having Clique Number α,Chromatic Number α+1

Let G is a simple graph,ω(G).△(G)、x(G)are maximum clique number ofG,maximum degree and chromatic number of G respectively.In[2],James defi-nes that(a,b,c)(where a,b,c are positive integer)is graphical if there existsG whichω(G)=a,x(G)=b,△(G)=c.We say G is on(a,b,c)and set P(a,b,(a,b,c)=min{|V(G)||G is on(a,b,c)}.All other signs are from[1].