2 problems

Let $K_w$ be the complete graph on $w$ vertices, let $C_n$ be the cycle graph on $n$ vertices, and let $mC_n$ denote the disjoint union of $m$ copies of $C_n$. Write…

Let $K_w$ be the complete graph on $w$ vertices, let $C_n$ be the cycle graph on $n$ vertices, and let $mC_n$ denote the disjoint union of $m$ copies of $C_n$. Write…