Given a cycle graph Cn and a complete graph Kn on n vertices (n>3), select all the correct statements. The degree of each vertice in Cn is 2 The total number of edges in Kn is C(n, 2). The degree of...

Extracted text: Given a cycle graph Cn and a complete graph Kn on n vertices (n>3), select all the correct statements. The degree of each vertice in Cn is 2 The total number of edges in Kn is C(n, 2). The degree of each vertice in Kn is (n-1). The total number of edges in Cn is n.