1 problem

Let $C_n$ be a cycle of length $n\geq 3$, and let $C_n^t$ be the graph obtained from the union of $t$ copies of $C_n$ with one vertex in common, called the central vertex. A graph…