The figure below shows a directed graph G: 3 4 Which edge is not in G 3. О а. (1, 3) O b. (2, 3) О с. (3, 4) O d. (4, 3)

2 5 10 6 5 10 11 16 9 14 10 1. Degree of a Vertex - Enumerate all vertices in this graph and identify their degrees.

Consider the following sets V = {v,V1, V2, V3, V4} and a set of vertices A simple graph can be such that d(vo) = 0, d(v1) = 1, d(v2) = 2, d(v3) = 3 and d(v4) = 4, explain why

E B What is the edge set of the graph? АВ, АС, AD, BC, ВЕ, DE А, В, С, D, E АВ, АС, AD, AЕ

if it is known that the graph has no direction G with the notation G = (V, E);  V = (1, 2, 3, 4, 5, 6);  E = (12, 14, 15, 23, 25, 26, 34, 36, 45, 46, 56) and there is a connected graph G' which is a subgraph of G which also has many vertices is 6 (| G'.V |  = | GV |) and the minimal number of edges. a.how many G'(spanning tree)?

13. Draw the graph G(V, E) where V = (a, b, c, d, e, f) and E = {ab, ad, bc, cd, cf, de, df).