We know the total degree (sum of the degrees) in an undirected graph G is equal to 66. How many edges does G have? How many edges are there in the complete graph K14? How many edges are there in C15 ? How many edges are there in the complete bipartite graph K3.3?

A simple connected graph with 2,024 vertices is such that there are exactly two vertices, u and v, with the same degree. What is the degree of u and v ? Justify your answer.

Which statement is TRUE? a. The sum of all degrees of a cycle graph equals 2* number of edges  b. An empty graph has |V|=0 and |E|=0 c. A complete graph is also a cycle graph d. The degree of vertices of a K-regular graph must be always 2

Discrete Math