Graph theory

For any cyclic graph with 2k vertices, We then construct a new graph C' _2k in the following manner: for each vertex v, we

add an edge between v and the vertex that diametrically opposite from v, i.e., to unique

vertex u that is exactly n edges away from v.

Now we have to prove that c'_2k is 3-connected (or not 4-connected).