Discrete Math - Graph Theory

7. Consider the graph below and complete the following exercises. (10 marks total) 10 12 13 14 16 17 a. If the graph above is denoted G where G = (V, E), what are V and E? b. Which vertex (or vertices) has (or have) the largest degree? c. Specify a path from vertex 5 to vertex 13 that does not contain vertex 3 or 9 d. If you were to remove vertex 9 from the graph (along with all the edges that connect to vertex 9) then you would have a new graph. In this new graph, which of the vertices would become cut vertices? element of the se that G - (V, E') the largest possible subgraph G' (of the graph G fv G' by lis s an ts of both V' and E such representation of this de an ad ve f. Consider the smallest set of edges E" that could need to be added to the graph above such that the graph (V, E UE" contains W6. Provide an exhaustive list of the elements of E" and specify the cardinality of E