2 Consider Kn the complete graph on n vertices Explain how y

2) Consider Kn, the complete graph on n vertices. Explain how you calculated your answers. a) What is the degree of each vertex? b) How many edges does Kn have? This problem is similar to Example 6 and to Exercises 13 and 14 in Section 8.1 of your SNHU MAT230 textbook.

Solution

KN has N vertices.

the degree of each vertex N 1.

number of edges that Kn have=N(N-1)/2

The sum of all degrees is N(N 1).