When a vertex v is connected by an edge to a vertex w, what is the term for the relationship between v and w? Question 1 options: a) v and w are \"adjacent.\" b) v and w are \"incident.\" c) v and w are \"insecure.\" d) v and w are \"isolated.\" If graph G has V = {1, 2, 3, 4} and E = { (1,2), (1,3), (2, 3), (2, 2), (1,4), (2, 2) }, which statement below is true? Question 2 options: a) Graph G has 5 edges. b) There are two loops in graph G. c) This graph is a simple graph. d) The cardinality of G is 6. Which edges are parallel or multiple in the given graph below: " Question 3 options: a) e5 and e6 b) e2 and e3 c) e2 and e6 d) e1 and e3 If we have two graphs G1 = (V1, E1) and G2= (V2, E2) and V1 = {a, b, c, d}, E1 = {(a, c), (a, d), (b, c), (a, b)}, V2 = {a, b, c, d}, E2 = { (c, a) , (a, d), (c, b), (a, b) }. Which statement below is true? Question 4 options: a) Graph G1 is equal to graph G2. b) Graph G1 is different from graph G2. c) E1 is different from E2 because at least one edge (a, c) in E1 is different from (c, a) in E2. d) V1 is different from V2 because they are from different graphs. How many vertices are there in this graph? " Question 5 options: a) 5 b) 3 c) 6 d) 4 Which set represents the vertices of the following graph? " Question 6 options: a) V = { {v1}, {v2}, {v3}, {v4}, {v5} b) V = ( v1,v2,v3,v4,v5) c) V = {v1,v2,v3,v4,v5} d) V = [ v1,v2,v3,v4,v5] What is the degree of the vertex v1 in the given graph as shown below? " Question 7 options: a) 4 b) 1 c) 3 d) 2 In the graphs G1 and G2 shown below, which statement is true? " Question 8 options: a) G1 and G2 have the same vertices. b) G1 and G2 have the same edges but some edges are just drawn differently. c) G1 and G2 is isomorphic. d) G1 and G2 is the same graph. Which graph representation is for the graph shown below? " Question 9 options: a) G = ( {u,v,x}, (u,v), (v,x) ) b) G = ( V = { u,v,x}, E= { (u,v), (v,x) } ) c) G = ( V={u, v, x, w}, E = { (u,v), (v,x)} ) d) G = ( {u,v,x,w}, { (u,w), (v,u) } ) If we have two graphs G1 = (V1, E1) and G2= (V2, E2) and V1 = {a, b, c}, E1 = {(a, c), (b, c), (a, b)}, V2 = {a, b, c}, E2 = { (c, a) , (c, b), (a, b) }. Which statement below is not true? Question 10 options: a) |G1| = |G2| b) V1 = V2 c) E1 = E2 d) G1 = G2 For given graph as shown below, what is the degree of V3? " Question 11 options: a) 5 b) 3 c) 6 d) 4 If the vertices set of a graph shows some elements as pairs of the same vertex such as (v1, v1), what does this mean? Question 12 options: a) Vertex v1 has a loop back to itself. b) Vertex v1 is a pendent vertex. c) Vertex v1 is not connected to other vertices. d) Vertex v1 is the only vertex of the graph. How many edges does this graph have? " Question 13 options: a) 15 b) 20 c) 5 d) 10 In the following graph, which of the following walks is a cycle? " Question 14 options: a) 123456 b) 124523 c) 1246531 d) 124231 Which graph below is a simple graph? " Question 15 options: a) second one b) first one c) fifth one d) fourth one