If G is a graph with degree sequence(5,5,3,3,2,2,2), the how many vertices and how many edges does G have?

In the three graphs below, the vertices represent cities and the edges represent roads connecting them. In which graphs could a person located in city A choose any other city and then find a sequence of roads to get from A to that other city? (Select all that apply.) B E D НЕ (a) (b) (c) graph (a) graph (b) graph (c) none of the graphs O O

1. The degree sequence of a graph is a list of the degrees of the vertices of a grap in decreasing order. Recall also that two graphs are isomorphic if they can be redrawn to look like one another. Find and draw two non-isomorphic trees with six vertices, both of which have degree sequence (3, 2, 2, 1, 1, 1).

Is it possible for a graph with 6 vertices to have degrees 2, 2, 2, 3, 5, and 9? (Loops are allowed.) Yes or No?