My school chose the worst math textbook for undergrad graph theory course. This textbook i think should be used for grad level. I have done the a and b and I am working on C. Please give me some tips or if you can give me a trivial explanation i would appreciate very much as I am not that fast at learning. Thanks you.
Textbook : Invitation to discrete mathematics.
HINT: Show that $\alpha(C_{n,k})=\left\lfloor\frac{n}{k+1}\right\rfloor$. What is $\omega(C_{n,k})$? What happens if $k+1$ is not a divisor of $n$?