Answer and Explain

Question 3 5.7 Points The degree sequence of a graph is a list of the degrees of all of the vertices in non-increasing order. The degree sequence for four different graphs are given below. Each graph is guaranteed to be connected. Select the degree sequence corresponding to the graph that has an Euler trail. 2, 2, 2, 4, 4, 4, 4 B 2, 4, 4, 4, 4, 4, 6 C 2, 2, 3 , 4 , 4 , 4 , 5 1, 2, 3, 3, 4, 4, 4, 5