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 15 options:

a)G1 = G2

b)E1 = E2

c)V1 = V2

d)|G1| = |G2|

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 11 options:

a)v and w are isolated.

b)v and w are incident.

c)v and w are adjacent.

d)v and w are insecure.

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 7 options:

a)This graph is a simple graph.

b)The cardinality of G is 6.

c)There are two loops in graph G.

d)Graph G has 5 edges.

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 5 options:

a)Vertex v1 has a loop back to itself.

b)Vertex v1 is not connected to other vertices.

c)Vertex v1 is the only vertex of the graph.

d)Vertex v1 is a pendent vertex.

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)E1 is different from E2 because at least one edge (a, c) in E1 is different from (c, a) in E2.

b)Graph G1 is equal to graph G2.

c)Graph G1 is different from graph G2.

d)V1 is different from V2 because they are from different graphs.